B'Given a string s, process q queries, each having one of the following forms: The first line of the input contains the string s (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89|s| xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105) of lowercase English letters. The second line contains an integer q (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89q xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105) -- the number of queries to process. The next q lines describe the queries and may have one of the following forms: c is a lowercase English letter and y is a non-empty string consisting of only lowercase English letters. The sum of |y| over all queries of second type is at most 105. It is guaranteed that there is at least one query of second type. All strings are 1-indexed. |s| is the length of the string s. For each query of type 2, output the required answer in a separate line. Consider the first sample case. Initially, the string aba occurs 3 times in the range [1, xe2 x80 x897]. Note that two occurrences may overlap. After the update, the string becomes ababcbaba and now aba occurs only once in the range [1, xe2 x80 x897]. '...