#include <bits/stdc++.h>
using namespace std;
const int Imx = 2147483647;
const long long Lbig = 2e18;
const int mod = 1e9 + 7;
struct fastio {
  char s[100000];
  int it, len;
  fastio() { it = len = 0; }
  inline char get() {
    if (it < len) return s[it++];
    it = 0;
    len = fread(s, 1, 100000, stdin);
    if (len == 0)
      return EOF;
    else
      return s[it++];
  }
  bool notend() {
    char c = get();
    while (c == ' ' || c == '\n') c = get();
    if (it > 0) it--;
    return c != EOF;
  }
} _buff;
inline long long getnum() {
  long long r = 0;
  bool ng = 0;
  char c;
  c = _buff.get();
  while (c != '-' && (c < '0' || c > '9')) c = _buff.get();
  if (c == '-') ng = 1, c = _buff.get();
  while (c >= '0' && c <= '9') r = r * 10 + c - '0', c = _buff.get();
  return ng ? -r : r;
}
template <class T>
inline void putnum(T x) {
  if (x < 0) putchar('-'), x = -x;
  register short a[20] = {}, sz = 0;
  while (x) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
inline char getreal() {
  char c = _buff.get();
  while (c <= 32) c = _buff.get();
  return c;
}
long long qpow(long long x, long long k) {
  return k == 0 ? 1
                : 1ll * qpow(1ll * x * x % mod, k >> 1) * (k & 1 ? x : 1) % mod;
}
char s[100111];
bitset<100005> ch[26], A, all;
char t[100111];
int main() {
  scanf("%s", s);
  int n = strlen(s);
  for (int i = 0; i < n; i++) ch[s[i] - 'a'][i] = 1, all[i] = 1;
  int q;
  scanf("%d", &q);
  while (q--) {
    int op, x;
    scanf("%d%d", &op, &x);
    x--;
    if (op == 1) {
      char c = getchar();
      while (c < 'a' || c > 'z') c = getchar();
      ch[s[x] - 'a'][x] = 0;
      s[x] = c;
      ch[s[x] - 'a'][x] = 1;
    } else {
      int y;
      scanf("%d", &y);
      y--;
      scanf("%s", t);
      int l = strlen(t);
      A = (all >> (n - (y - x + 1) + l - 1)) << x;
      for (int i = 0; i < l; i++) A = (A & ch[t[i] - 'a']) << 1;
      printf("%d\n", A.count());
    }
  }
  return 0;
}
