#include <bits/stdc++.h>
using namespace std;
bitset<100005> mask[26];
void computeMask(string &text) {
  for (int i = 0; i < (int)text.size(); ++i) {
    int c = text[i] - 'a';
    mask[c].set(i);
  }
}
int StringMatchingInRange(string &pattern, string &text, long long l,
                          long long r) {
  if ((int)pattern.size() > (r - l + 1)) return 0;
  bitset<100005> startMask;
  startMask.set();
  for (int i = 0; i < (int)pattern.size(); ++i) {
    int c = pattern[i] - 'a';
    startMask &= (mask[c] >> i);
  }
  return (startMask >> (l)).count() -
         (startMask >> (r - (int)pattern.size() + 2)).count();
}
int StringMatching(string &pattern, string &text) {
  if ((int)pattern.size() > (int)text.size()) return 0;
  bitset<100005> startMask;
  startMask.set();
  for (int i = 0; i < (int)pattern.size(); ++i) {
    int c = pattern[i] - 'a';
    startMask &= (mask[c] >> i);
  }
  return startMask.count();
}
void update(int idx, char ch, string &text) {
  char old = text[idx];
  mask[old - 'a'][idx] = 0;
  text[idx] = ch;
  mask[ch - 'a'][idx] = 1;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string s, t;
  cin >> t;
  computeMask(t);
  int q, ty, l, r, x;
  char ch;
  cin >> q;
  while (q--) {
    cin >> ty;
    if (ty == 2) {
      cin >> l >> r >> s;
      l--, r--;
      cout << StringMatchingInRange(s, t, l, r) << endl;
    } else {
      cin >> x >> ch;
      x--;
      update(x, ch, t);
    }
  }
  return 0;
}
