Problem: Given a string s, process q queries, each having one of the following forms:

  * 1 i c — Change the i-th character in the string to c. 
  * 2 l r y — Consider the substring of s starting at position l and ending at position r. Output the number of times y occurs as a substring in it. 

Input

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

The second line contains an integer q (1 ≤ q ≤ 105) — 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 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.

Output

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

Examples

Input

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


Output

3
1


Input

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


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].

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma GCC optimize(2)
const int MAXN = 1e5 + 19;
std::bitset<MAXN> myBit[26], ans;
int q, len;
char str[MAXN], s[MAXN];
int opt, x, l, r;
inline int up(int x) { return x > 0 ? x : 0; }
int main() {
  std::scanf("%s%d", str + 1, &q);
  len = std::strlen(str + 1);
  for (int i = 1; i <= len; ++i) myBit[str[i] - 'a'][i] = 1;
  while (q--) {
    std::scanf("%d", &opt);
    if (opt == 1) {
      std::scanf("%d%s", &x, s + 1);
      myBit[str[x] - 'a'][x] = 0;
      str[x] = s[1];
      myBit[str[x] - 'a'][x] = 1;
    } else if (opt == 2) {
      std::scanf("%d%d%s", &l, &r, s + 1);
      len = std::strlen(s + 1);
      ans.set();
      for (int i = 1; i <= len; ++i) ans &= myBit[s[i] - 'a'] >> (i - 1);
      r = r - len + 1;
      std::printf("%d\n", up(((ans >> l).count() - (ans >> (r + 1)).count())));
    }
  }
  return 0;
}