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>
using namespace std;
const int maxN = 1e5 + 10;
int q;
int a[maxN + 1];
char s[maxN + 1];
bitset<maxN> b[26], res;
int main() {
  scanf("%s", s + 1);
  int len = strlen(s + 1);
  for (int i = 1; i <= len; i++) b[a[i] = s[i] - 'a'].flip(i);
  scanf("%d", &q);
  while (q--) {
    int op, x, y;
    scanf("%d", &op);
    if (op == 1) {
      scanf("%d %s", &x, s + 1);
      int c = s[1] - 'a';
      b[a[x]].flip(x);
      b[a[x] = c].flip(x);
    } else {
      scanf("%d %d %s", &x, &y, s + 1);
      len = strlen(s + 1);
      if (y - x + 1 < len) {
        puts("0");
        continue;
      }
      res.set();
      for (int i = len; i >= 1; i--) {
        res = res & b[s[i] - 'a'];
        if (i > 1) res >>= 1;
      }
      printf("%d\n",
             (int)(res >> x).count() - (int)(res >> (y - len + 2)).count());
    }
  }
  return 0;
}