#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pl pair<ll, ll>
#define pi pair<int, int>
#define minpq priority_queue<ll, vector<ll>, greater<ll>>
using namespace std;

#if 1
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '['; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "]";}
void _print() {cerr << endl << flush;}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "*["<<__LINE__<<"]\t"<< #x << " = "; _print(x)
#endif

const ll mod = 1e9 + 7;

template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
ll gcd(ll a, ll b) {if(b == 0){return a;} return gcd(b, a % b);}

struct segtree{
	vector<int> cnt[64];
	vector<int> lazy;
	int sz;

	void init(int n){
		sz = 1;
		while(sz < n) sz <<= 1;
		for (int i = 0; i < 64; i ++){
			cnt[i].assign(2 * sz, 0);
		}
		lazy.assign(2 * sz, 0);
	}

	void push(int x, int lx, int rx){
		for (int i = 0; i < 64; i ++){
			if ((i ^ lazy[x]) > i) swap(cnt[i][x], cnt[i ^ lazy[x]][x]);
		}
		if (rx - lx != 1){
			lazy[2 * x + 1] ^= lazy[x];
			lazy[2 * x + 2] ^= lazy[x];
		}
		lazy[x] = 0;
	}

	void build(vector<int>& a, int x, int lx, int rx){
		if (rx - lx == 1){
			if (lx < a.size()) cnt[a[lx]][x] = 1;
			return;
		}
		int mid = (lx + rx) >> 1;
		build(a, 2 * x + 1, lx, mid);
		build(a, 2 * x + 2, mid, rx);
		for (int i = 0; i < 64; i ++){
			cnt[i][x] = cnt[i][2 * x + 1] + cnt[i][2 * x + 2];
		}
	}

	void build(vector<int>& a){
		build(a, 0, 0, sz);
	}

	void upd(int l, int r, int v, int x, int lx, int rx){
		push(x, lx, rx);
		if (lx >= r || rx <= l) return;
		if (lx >= l && rx <= r){
			lazy[x] ^= v;
			//we have to push here! since we need to compute sum when we go up
			push(x, lx, rx);
			return;
		}
		int mid = (lx + rx) >> 1;
		upd(l, r, v, 2 * x + 1, lx, mid);
		upd(l, r, v, 2 * x + 2, mid, rx);
		for (int i = 0; i < 64; i ++){
			cnt[i][x] = cnt[i][2 * x + 1] + cnt[i][2 * x + 2];
		}
	}

	void upd(int l, int r, int v){
		upd(l, r, v, 0, 0, sz);
	}

	vector<int> calc(int l, int r, int x, int lx, int rx){
		push(x, lx, rx);
		vector<int> ans(64, 0);
		if (lx >= r || rx <= l) return ans;
		if (lx >= l && rx <= r){
			for (int i = 0; i < 64; i ++) ans[i] = cnt[i][x];
			return ans;
		}
		int mid = (lx + rx) >> 1;
		vector<int> ans1 = calc(l, r, 2 * x + 1, lx, mid), ans2 = calc(l, r, 2 * x + 2, mid, rx);
		for (int i = 0; i < 64; i ++) ans[i] = ans1[i] + ans2[i];
		return ans;
	}

	vector<int> calc(int l, int r){
		return calc(l, r, 0, 0, sz);
	}
};
 
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	string s; cin >> s;
	int q; cin >> q;
	int n = s.size(), val = 0;
	segtree seg;
	seg.init(n + 1);
	vector<int> a(n + 1);
	for (int i = 0; i < n; i ++){
		val ^= 1 << (s[i] - 'a');
		a[i + 1] = val;
	}
	seg.build(a);
	while(q --){
		int op; cin >> op;
		if (op == 1){
			int l, r; cin >> l >> r; l --;
			ll ans = 0;
			vector<int> cur = seg.calc(l, r + 1);
			for (int i = 0; i < 64; i ++){
				ans += (ll)cur[i] * (ll)(cur[i] - 1) / 2;
			}
			cout << ans << '\n';
		} else{
			int i; char x; cin >> i >> x;
			seg.upd(i, n + 1, (1 << (x - 'a')) ^ (1 << (s[i - 1] - 'a')));
			s[i - 1] = x;
		}
	}
}