#include<bits/stdc++.h>

#define ll long long
#define pi pair<int,int>
#define vi vector<int>
#define cpy(x,y,s) memcpy(x,y,sizeof(x[0])*(s))
#define mset(x,v,s) memset(x,v,sizeof(x[0])*(s))
#define all(x) begin(x),end(x)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ary array
#define eb emplace_back
#define IL inline

using namespace std;

#define N 500005

int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0' || ch>'9')f=(ch=='-'?-1:f),ch=getchar();
    while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    return x*f;
}
void write(int x){
    if(x<0)x=-x,putchar('-');
    if(x/10)write(x/10);
    putchar(x%10+'0');
}

deque<char> q;
char s[N],c[7]={'n','a','n','j','i','n','g'};

void solve(){
    while(q.size())q.pop_front();
    int n=read(),k=read();k=min(k,n-1);
    scanf("%s",s+1);
    if(n<7){write(0);putchar('\n');return;}
    for(int i=1;i<=n;i++)q.push_back(s[i]);
    int ans=0,res=0;
    auto calc=[&](int p){
        for(int j=0;j<7;j++){
            if(q[j+p]==c[j]);
            else return 0;
        }
        return 1;
    };
    for(int i=0;i+6<q.size();i++)ans+=calc(i);
    res=max(res,ans);
    for(int i=1;i<=k;i++){
        ans-=calc(0);if(q.size()-7!=0)ans-=calc(q.size()-7);
        q.push_back(q.front());q.pop_front();
        ans+=calc(0);if(q.size()-7!=0)ans+=calc(q.size()-7);res=max(res,ans);
    }
    write(res);putchar('\n');
}

int main(){
    #ifdef EAST_CLOUD
    freopen("a.in","r",stdin);
    //freopen("a.out","w",stdout);
    #endif

    int T=read();while(T--)solve();
    return 0;
}