#include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define vi vector<int>
#define vll vector<long long>
#define double long double
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<'*'<<x<<'\n';
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define rep(x, y) for(int i=(x); i<=(y); i++)
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
const int INF=0x3f3f3f3f;
const ll LINF=0x3f3f3f3f3f3f3f3f;
const int mod=1e9+7;
ll gcd(ll a,ll b)
{
	return b?gcd(b,a%b):a;
}
ll lcm(ll a,ll b)
{
	return a*b/gcd(a,b);
}
ll qmi(ll a,ll b)
{
	ll ans=1;
	while(b)
	{
		if(b&1)ans=ans*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return ans;
}




void solve()
{
	int n, k;
	string s;
	cin >> n >> k;
	cin >> s;
	int res = 0, t = 0;
	for(int i = 0; i < n; i++)
	{
		int idx = s.find("nanjing", i);
		if(idx != -1)t++, i = idx + 1;
		
	}
	res = max(res, t);
	for(int i = 0; i < min(7ll, k); i++)
	{
		s = s.substr(1) + s[0];
		t = 0;
		for(int j = 0; j < n; j++)
		{
			int idx = s.find("nanjing", j);
			if(idx != -1)t++, j = idx + 1;
		}
		res = max(res, t);
	}
	cout << res << endl;
}



signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int _;
	_=1;
	cin>>_;
	while(_--)solve();
	return 0;
}