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>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
const long long N = 100001;
const long long MOD = 1000000007;
const long long INF = LLONG_MAX;
bitset<N> bs[26], all, ans;
int main() {
  ios::sync_with_stdio(false), cin.tie(NULL);
  int t = 1, cs = 0;
  while (t--) {
    int n, q, type, id, i, l, r;
    string s, p;
    char ch;
    cin >> s >> q;
    n = s.size();
    for (i = 0; i < n; i++) {
      all[i] = 1;
      bs[s[i] - 'a'][i] = 1;
    }
    while (q--) {
      cin >> type;
      if (type == 1) {
        cin >> id >> ch;
        id--;
        bs[s[id] - 'a'][id] = 0;
        bs[ch - 'a'][id] = 1;
        s[id] = ch;
      } else {
        cin >> l >> r >> p;
        if (p.size() > r - l + 1) {
          cout << 0 << endl;
          continue;
        }
        ans = all;
        for (i = 0; i < p.size(); i++) ans &= (bs[p[i] - 'a'] >> i);
        cout << (ans >> (l - 1)).count() - (ans >> (r - p.size() + 1)).count()
             << endl;
      }
    }
  }
}
