#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
void solve()
{
    int n,k;
    cin>>n>>k;
    k=min({7ll,k,n});
    string s;
    cin>>s;
    deque<char> q;
    for(int i=0;i<n;i++) q.push_back(s[i]);
    int ans=0;
    for(int i=0;i<=k;i++)
    {
        int num=0;
        for(int j=0;j+6<n;j++)
        {
            string tmp;
            for(int k=0;k<7;k++)
                tmp+=q[j+k];
            if(tmp=="nanjing") num++;
        }
        ans=max(ans,num);
        q.push_back(q.front());
        q.pop_front();
    }
    cout<<ans<<endl;
}
signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    int t=1;
    cin>>t;
    while(t--) solve();
    return 0;
}