#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
#include <algorithm>
#include <cmath>
#include <random>
#include <ctime>
#include <cstdlib>
#include <chrono>

using namespace std;

void solve() {
  int n, k;
  cin >> n >> k;

  string s;
  cin >> s;

  for (int i = 0; i < 17; ++i) {
    s.push_back(s[i]);
  }

  int ans = 0;
  for (int i = 0; i <= min({k, n, 8}); ++i) {
    int nr = 0;
    for (int j = i; j + 6 < n + i; ++j) {
      if (s.substr(j, 7) == "nanjing") {
        ++nr;
      }
    }

    ans = max(ans, nr);
  }

  cout << ans << "\n";
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);

  int t = 1;
  cin >> t;
  while (t--)
    solve();

  return 0;
}