#include <bits/stdc++.h>
using namespace std;
template <class t>
inline t read(t &x) {
  x = 0;
  char c = getchar();
  bool f = 0;
  while (!isdigit(c)) f |= c == '-', c = getchar();
  while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  if (f) x = -x;
  return x;
}
template <class t>
inline void write(t x) {
  if (x < 0) {
    putchar('-'), write(-x);
  } else {
    if (x > 9) write(x / 10);
    putchar('0' + x % 10);
  }
}
const int N = 1e5 + 5;
bitset<N> a[30], ans;
char s[N], ss[N];
int q;
signed main() {
  scanf("%s", s);
  for (int i = 0; s[i]; i++) a[s[i] - 'a'][i] = 1;
  read(q);
  while (q--) {
    int op;
    read(op);
    if (op == 1) {
      int id;
      char c;
      read(id);
      scanf(" %c", &c);
      id--;
      a[s[id] - 'a'][id] = 0;
      a[c - 'a'][id] = 1;
      s[id] = c;
    } else {
      int l, r;
      read(l);
      l--;
      read(r);
      r--;
      scanf("%s", ss);
      ans.set();
      for (int i = 0; ss[i]; i++) ans &= a[ss[i] - 'a'] >> i;
      int rn = (ans >> l).count(),
          ln = (ans >> (r - (strlen(ss) - 1) + 1)).count();
      write(max(0, rn - ln));
      puts("");
    }
  }
}
