String Set Queries

维护一个字符串集合，支持三种操作： 1. 加字符串 2. 删字符串 3. 查询集合中的所有字符串在给出的模板串中出现的次数 操作数 $m \leq 3 \times 10^5$，输入字符串总长度 $\sum |s_i| \leq 3\times 10^5$。 **本题强制在线，应该在每次输出后调用```fflush(stdout)```。你只有在输出上一个询问的答案后才能读入下一组询问。**

You should process $ m $ queries over a set $ D $ of strings. Each query is one of three kinds: 1. Add a string $ s $ to the set $ D $ . It is guaranteed that the string $ s $ was not added before. 2. Delete a string $ s $ from the set $ D $ . It is guaranteed that the string $ s $ is in the set $ D $ . 3. For the given string $ s $ find the number of occurrences of the strings from the set $ D $ . If some string $ p $ from $ D $ has several occurrences in $ s $ you should count all of them. Note that you should solve the problem in online mode. It means that you can't read the whole input at once. You can read each query only after writing the answer for the last query of the third type. Use functions fflush in C++ and BufferedWriter.flush in Java languages after each writing in your program.

The first line contains integer $ m $ ( $ 1<=m<=3·10^{5} $ ) — the number of queries. Each of the next $ m $ lines contains integer $ t $ ( $ 1<=t<=3 $ ) and nonempty string $ s $ — the kind of the query and the string to process. All strings consist of only lowercase English letters. The sum of lengths of all strings in the input will not exceed $ 3·10^{5} $ .

For each query of the third kind print the only integer $ c $ — the desired number of occurrences in the string $ s $ .

5
1 abc
3 abcabc
2 abc
1 aba
3 abababc

2
2

10
1 abc
1 bcd
1 abcd
3 abcd
2 abcd
3 abcd
2 bcd
3 abcd
2 abc
3 abcd

3
2
1
0