#include <bits/stdc++.h>
inline int sbt(int x) { return __builtin_popcount(x); }
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
int n;
string s;
int q;
bitset<100013> bit[27];
int main() {
  cin.sync_with_stdio(false);
  cout.sync_with_stdio(false);
  cin >> s;
  s = '$' + s;
  for (int i = 1; i < s.size(); i++) {
    bit[s[i] - 'a'].set(i, 1);
  }
  const int nm = s.size() - 1;
  bitset<100013> o;
  for (int i = 0; i < nm; i++) o.set(i);
  cin >> q;
  while (q--) {
    int ty;
    cin >> ty;
    if (ty == 1) {
      int i;
      char c;
      cin >> i >> c;
      bit[s[i] - 'a'].set(i, 0);
      bit[c - 'a'].set(i, 1);
      s[i] = c;
    } else {
      bitset<100013> res = o;
      int l, r;
      string t;
      cin >> l >> r >> t;
      if ((r - l + 1) < t.size()) {
        cout << 0 << endl;
        continue;
      }
      t = '$' + t;
      int n = t.size();
      for (int i = 1; i < n; i++) {
        res = (res & (bit[t[i] - 'a'] >> i));
      }
      if ((r - (n - 1) + 1) < 0) {
        cout << 0 << endl;
        continue;
      }
      cout << ((res >> (l - 1)).count()) - ((res >> (r - (n - 1) + 1)).count())
           << endl;
    }
  }
  return 0;
}
