#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <set>
#include <string>
using std::cin, std::cout;

#define F(i, a, b) for(int i = a; i <= (b); ++i)
#define F2(i, a, b) for(int i = a; i < (b); ++i)
#define dF(i, a, b) for(int i = a; i >= (b); --i)

void Init();
void Solve();
int main() {
    cin.sync_with_stdio(false);
    cin.tie(nullptr);
    Init();
    int tests = 1;
    cin >> tests;
    while (tests--)
        Solve();
    return 0;
}

using LL = long long;
const int Mod = 998244353;

const int Inf = 0x3f3f3f3f;
const LL InfLL = 0x3f3f3f3f3f3f3f3f;

const int MN = 500005;

int n, m, q, k;
int a[MN], b[MN], f[MN], g[MN];
std::vector<int> G[MN];

void Init() {
}

void Solve() {
    cin >> n >> k;
    std::string s;
    cin >> s;
    if (n < 7)
        return void(cout << "0\n");
    F(i, 1, n)
        a[i] = s[i - 1];
    F(i, 1, n)
        a[n + i] = a[i];
    k = std::min(k, n - 1);
    F(i, 1, 2 * n - 7 + 1) {
        std::string s2(7, ' ');
        F2(j, 0, 7)
            s2[j] = a[i + j];
        if (s2 == "nanjing")
            b[i] = 1;
        else
            b[i] = 0;
    }
    F(i, 1, 2 * n - 7 + 1)
        b[i] += b[i - 1];
    int ans = 0;
    F(i, 1, k + 1)
        ans = std::max(ans, b[i + n - 7] - b[i - 1]);
    cout << ans << '\n';
}