#include<bits/stdc++.h>
#define int long long
#define mod 998244353ll
#define pii pair<int,int>
#define fi first
#define se second
#define mems(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define db double
using namespace std;
const int maxn=400010;
const int inf=1e18;
inline int read(){
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch-48);ch=getchar();}
	return x*f;
}
bool Mbe;

int n,k,ans;
char s[maxn];
bool vis[maxn];
int sum[maxn];
int calc(int l,int r){
	if(l>r)return 0;
	return sum[r]-sum[l-1];
}
void work(){
	n=read();k=read();ans=0;
	for(int i=1;i<=n;i++)vis[i]=0;
	scanf("%s",s+1);
	for(int i=1;i<=n;i++)s[i+n]=s[i];
	for(int i=1;i<=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')vis[i]=vis[i+n]=1;
	for(int i=1;i<=2*n;i++)sum[i]=sum[i-1]+vis[i];
	k=min(n,k);
	for(int i=0;i<=k;i++){
		ans=max(ans,calc(i+1,n-6+i));
	}
	printf("%lld\n",ans);
}

// \
444

bool Med;
int T;
signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	
//	ios::sync_with_stdio(0);
//	cin.tie(0);cout.tie(0);
	
//	cerr<<(&Mbe-&Med)/1048576.0<<" MB\n";
	
	T=read();
	while(T--)work();
}