#include<bits/stdc++.h>
using namespace std;
#define mem(a , b) memset(a , b , sizeof(a))
const int maxn = 250001;
#define ll long longstruct SAM{int trans[maxn<<1][26] , slink[maxn<<1] , maxlen[maxn<<1];int last , now , root;ll ans=0;int sum[maxn<<1];void newnode(int v){maxlen[++now]=v;mem(trans[now],0);}void extend(int c , int k){newnode(maxlen[last] + 1);int p = last , np = now;sum[now]=0;//  cout<<now<<endl;while(p && !trans[p][c]){trans[p][c] = np;p = slink[p];}if(!p) slink[np] = root;else{int q = trans[p][c];if(maxlen[p] + 1 != maxlen[q]){newnode(maxlen[p] +1 );int nq = now;memcpy(trans[nq] , trans[q] , sizeof(trans[q]));sum[nq]=sum[q];///分开的节点要继承slink[nq] = slink[q];slink[q] = slink[np] = nq;while(p && trans[p][c] == q){trans[p][c] = nq;p = slink[p];}}else{slink[np]=q;}}last = np;int w=np;while(w && sum[w] < k ){sum[w]++;if(sum[w]==k) ans+=maxlen[w]-maxlen[slink[w]];w=slink[w];}// cout<<np<<endl;
    }void init(){root = last = now = 1;slink[root]=0;mem(trans[root],0);sum[root]=0;ans=0;}}sam;
int main()
{int n,q,k;while(scanf("%d%d%d",&n,&q,&k)!=EOF){sam.init();char str[maxn];scanf("%s",str);for(int i=0 ; i<n ; i++){sam.extend(str[i]-'a'  , k);}while(q--){int T;scanf("%d",&T);getchar();if(T==1){ char op;op=getchar();sam.extend(op-'a' , k );// cout<<op<<endl;
        }else{printf("%lld\n",sam.ans);}}}}

#include<bits/stdc++.h>
using namespace std;
#define mem(a , b) memset(a , b , sizeof(a))
const int maxn = 250001;
#define ll long longstruct SAM{int trans[maxn<<1][26] , slink[maxn<<1] , maxlen[maxn<<1];int last , now , root;ll ans=0;int sum[maxn<<1];void newnode(int v){maxlen[++now]=v;mem(trans[now],0);}void extend(int c , int k){newnode(maxlen[last] + 1);int p = last , np = now;sum[now]=0;//  cout<<now<<endl;while(p && !trans[p][c]){trans[p][c] = np;p = slink[p];}if(!p) slink[np] = root;else{int q = trans[p][c];if(maxlen[p] + 1 != maxlen[q]){newnode(maxlen[p] +1 );int nq = now;memcpy(trans[nq] , trans[q] , sizeof(trans[q]));sum[nq]=sum[q];///分开的节点要继承slink[nq] = slink[q];slink[q] = slink[np] = nq;while(p && trans[p][c] == q){trans[p][c] = nq;p = slink[p];}}else{slink[np]=q;}}last = np;int w=np;while(w && sum[w] < k ){sum[w]++;if(sum[w]==k) ans+=maxlen[w]-maxlen[slink[w]];w=slink[w];}// cout<<np<<endl;
    }void init(){root = last = now = 1;slink[root]=0;mem(trans[root],0);sum[root]=0;ans=0;}}sam;
int main()
{int n,q,k;int t;scanf("%d",&t);while(t--){string str;int k;cin>>k>>str;sam.init();n=str.size();for(int i=0 ; i<n ; i++){sam.extend(str[i]-'a'  , k);}ll sum1=sam.ans;sam.init();for(int i=0 ; i<n ; i++){sam.extend(str[i]-'a'  , k+1);}ll sum2=sam.ans;printf("%lld\n",sum1-sum2);}}