#include<bits/stdc++.h>

using namespace std;
int n, m;
void solve() {
  string s;
  cin >> n >> m;
  cin >> s;
  s += s;
  s = '#' + s;
  vector<int> b(n * 2 + 5);
  for (int i = 7; i <= n*2;i++){
    b[i] = b[i - 1];
    if(s[i-6]=='n'&&s[i-5]=='a'&&s[i-4]=='n'&&s[i-3]=='j'&&s[i-2]=='i'&&s[i-1]=='n'&&s[i]=='g'){
      b[i] = b[i - 7] + 1;
      //cout << b[i] << "\n";
    }
  }
  int mx = 0;
  for (int i = n; i <= n * 2 && i <= n + m;i++){
    mx = max(b[i]-b[i-n]-(b[i-n+5]-b[i-n]), mx);
  }
  cout << mx << "\n";
}
signed main() {
  int _=1;
  cin >> _;
  while(_--){
    solve();
  }
  return 0;
}