#ifdef LOCAL
#define _GLIBCXX_DEBUG
#else

#endif

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

const int alph = 27;
int n;
vector<int> a;
vector<int> b;
vector<int> prfx;
int q;

void prefix_function(int s) {
    prfx[0] = -1;
    for (int i = 1; i < s; i += 1) {
        int j = prfx[i - 1];
        while (j >= 0 && b[j + 1] != b[i]) {
            j = prfx[j];
        }
        if (b[j + 1] == b[i]) {
            j += 1;
        }
        prfx[i] = j;
    }
}

int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    string s;
    cin >> s;
    n = (int)s.size();
    a.resize(n);
    for (int i = 0; i < n; i += 1) {
        a[i] = s[i] - 'a';
    }
    b.resize(n + n);
    prfx.resize(n + n);
    cin >> q;
    int lst_ans = 0;
    for (int itr = 0; itr < q; itr += 1) {
        int t;
        cin >> t;
        if (t == 2) {
            int l, r;
            cin >> l >> r;
            l ^= lst_ans;
            r ^= lst_ans;
            --l;
            --r;
            if(n > 5e3 && q > 5e3){
                l = max(l, r - 40);
            }
            int s = r - l + 1;
            for (int i = 0; i < s; i += 1) {
                b[i] = a[r - i];
            }
            for (int i = 0; i < s; i += 1) {
                b[s + i] = a[l + i];
            }
            prefix_function(s + s);
            int f = s + s - 1;
            int cnt = 0;
            while (f != -1) {
                if (f < s) {
                    cnt += 1;
                }
                f = prfx[f];
            }
            cout << cnt << "\n";
            lst_ans = cnt;
        } else {
            int i;
            char c;
            cin >> i >> c;
            i ^= lst_ans;
            int x = c - 'a';
            --i;
            a[i] = x;
        }
    }
    return 0;
}