#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<bits/stdc++.h>
using namespace std;
int f[400004];
int main(){
	
	int t;
	cin>>t;
	while(t--){
		int n, k;
		string s;
        cin>>n>>k;
        if(k>n) k=n;
        cin>>s;
        s+=s; s=' '+s;
		memset(f,0,sizeof(f));
		//for(int i=1;i<=n;i++){
		//	cin>>s[i];
			//s[i+n]=s[i];
		//}
		//cout<<s<<endl;
		/*for(int i=1;i<=n+k;i++){
			if(s[i]=='n' && s[i+1]=='a' && s[i+2]=='n' && s[i+3]=='j'
			   && s[i+4]=='i' && s[i+5]=='n' && s[i+6]=='g'){
				if(f[l]!=0 && i%f[l]==0) l++;
				f[r++]=i;
				cout<<l<<' '<<r<<' '<<i<<' '<<endl; 
			}
		}
		cout<<r-l+1<<endl;*/
		for(int i=0;i+6<2*n;i++) {
            if(s[i]=='n' && s[i+1]=='a' && s[i+2]=='n' && s[i+3]=='j' && s[i+4]=='i' && s[i+5]=='n' && s[i+6]=='g') 
			   f[i]++;
            f[i+1]+=f[i];
        }
        int ans=0;
        for(int i=0;i<=k;i++) 
            ans=max(ans,f[max(n+i-6,0)]-f[i]);
        
        cout<<ans<< endl;
	} 
	return 0;
}