/** author: shobonvip created: 2025.08.16 18:04:39 **/ #include using namespace std; //* ATCODER #include using namespace atcoder; typedef modint998244353 mint; //*/ /* BOOST MULTIPRECISION #include using namespace boost::multiprecision; //*/ typedef long long ll; #define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++) #define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--) #define all(v) v.begin(), v.end() template bool chmin(T &a, const T &b) { if (a <= b) return false; a = b; return true; } template bool chmax(T &a, const T &b) { if (a >= b) return false; a = b; return true; } template T max(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]); return ret; } template T min(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]); return ret; } template T sum(vector &a){ T ret = 0; for (int i=0; i<(int)a.size(); i++) ret += a[i]; return ret; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n,q;cin>>n>>q; string s;cin>>s; const int sz=1<<18; auto get=[&](map&mp, int i) -> ll { if(mp.find(i)==mp.end())return 0LL; return mp[i]; }; auto upd=[&](map&mp, int i, ll j) -> void { i+=sz; mp[i]=j; i>>=1; while(i>0){ mp[i]=get(mp,2*i)+get(mp,2*i+1); i>>=1; } return; }; auto prod=[&](map&mp, int l, int r) -> ll { l+=sz; r+=sz; ll ret=0; while(l>=1; r>>=1; } return ret; }; map> mp0; map> mp1; rep(i,2,n){ upd(mp0[s.substr(i-2,3)],i,1LL); upd(mp1[s.substr(i-2,3)],i,(ll)i); } while(q--){ int t;cin>>t; if(t==1){ int k;char c; cin>>k>>c; k--; rep(j,max(2,k),min(k+3,n)){ upd(mp0[s.substr(j-2,3)],j,0LL); upd(mp1[s.substr(j-2,3)],j,0LL); } s[k]=c; rep(j,max(2,k),min(k+3,n)){ upd(mp0[s.substr(j-2,3)],j,1LL); upd(mp1[s.substr(j-2,3)],j,(ll)j); } }else{ int l,r; cin>>l>>r; l--; string a;cin>>a; if(r-l<=2){ cout<<0<<'\n'; continue; } ll v1=prod(mp1[a],l+2,r); ll v0=prod(mp0[a],l+2,r); ll ans=v1-(l+1)*v0; cout<