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(3)
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("inline-functions-called-once")
using namespace std;
int q;
char s[100005] = {0};
bitset<100005> m[27], ans;
int main() {
  scanf("%s", s);
  int len = strlen(s);
  for (int i = 0; i < len; i++) {
    if (s[i] >= 'a' && s[i] <= 'z') {
      m[s[i] - 'a'][i + 1] = 1;
    }
  }
  scanf("%d", &q);
  for (int i = 1; i <= q; i++) {
    int op;
    scanf("%d", &op);
    if (op == 1) {
      int pos;
      char ne;
      scanf("%d %c", &pos, &ne);
      m[s[pos - 1] - 'a'][pos] = 0;
      m[ne - 'a'][pos] = 1;
      s[pos - 1] = ne;
    } else if (op == 2) {
      int tl, tr;
      char s2[100005] = {0};
      scanf("%d %d %s", &tl, &tr, s2);
      ans.set();
      int lens2 = strlen(s2);
      for (int j = 0; j < lens2; j++) {
        ans &= (m[s2[j] - 'a'] >> j);
      }
      int leftN = (ans >> (tl)).count();
      int rigthN = (ans >> (tr - lens2 + 2)).count();
      if (leftN - rigthN < 0) leftN = rigthN;
      printf("%d\n", leftN - rigthN);
    }
  }
  return 0;
}