Substrings in a String

Description:

Input:

The first line of the input contains the string s (1 ≤ |s| ≤ 10⁵) of lowercase English letters.

The second line contains an integer q (1 ≤ q ≤ 10⁵)  — the number of queries to process.

The next q lines describe the queries and may have one of the following forms:

• 1 i c (1 ≤ i ≤ |s|)
• 2 l r y (1 ≤ l ≤ r ≤ |s|)

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 10⁵.

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.

Output:

For each query of type 2, output the required answer in a separate line.

Sample Input:

ababababa
3
2 1 7 aba
1 5 c
2 1 7 aba

Sample Output:

3
1

Sample Input:

abcdcbc
5
2 1 7 bc
1 4 b
2 4 7 bc
1 2 a
2 1 4 aa

Sample Output:

2
2
1

Note:

Consider the first sample case. Initially, the string aba occurs 3 times in the range [1, 7]. Note that two occurrences may overlap.

After the update, the string becomes ababcbaba and now aba occurs only once in the range [1, 7].