#include <bits/stdc++.h>
#define X first
#define Y second
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using vi=vector<int>;
using vl=vector<ll>;
#define PB push_back
#define all(a) begin(a),end(a)

const int N=300010,MOD=1e9+7;
const char en='\n';
const ll LLINF=1ll<<60;

int n, k;
string s;

void solve() {
	cin >> n >> k >> s;
	k = min(8, k);
	int ans = 0;
	for(int i = 0;i <= k;i++) {
		int cur = 0;
		for(int j = 0;j + 6 < n;j++) {
			cur += (s.substr(j, 7) == "nanjing");
		}
		ans = max(ans, cur);
		s.push_back(s[0]);
		s.erase(s.begin());
	}
	cout << ans << endl;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int T; cin >> T;
	for(;T--;) solve();
}