abcdabcdab
5
2 2 8 ab
2 1 10 ab
1 3 a
1 4 b
2 1 4 ab

1
3
2

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
bitset<maxn> rec[30], ans;
char s1[maxn], s2[maxn];
int idx(char c) { return c - 'a'; }
int main() {
  scanf("%s", s1 + 1);
  int n = strlen(s1 + 1);
  for (int i = 1; i <= n; ++i) rec[idx(s1[i])][i] = 1;
  int Q;
  scanf("%d", &Q);
  while (Q--) {
    int op;
    scanf("%d", &op);
    if (op == 1) {
      int pos;
      char ch;
      scanf("%d %c", &pos, &ch);
      rec[idx(s1[pos])][pos] = 0;
      rec[idx(ch)][pos] = 1;
      s1[pos] = ch;
    } else {
      int l, r;
      scanf("%d%d%s", &l, &r, s2);
      int m = strlen(s2);
      ans.set();
      for (int i = 0; i < m; ++i) ans &= (rec[idx(s2[i])] >> i);
      int cntl = (ans >> l).count();
      int cntr = (ans >> (r - m + 2)).count();
      printf("%d\n", cntl - cntr);
    }
  }
  return 0;
}
