#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using namespace std;

using ll = long long;

const string target = "nanjing";

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

    k = min(k, n);
    string T = S + S;
    int sum = 0;
    vector<int> imos(2 * n + 1, 0);
    for (int i = 0; i < n and i + 7 <= 2 * n; i++) {
        if (T.substr(i, 7) != target) continue;
        sum++;
        imos[i + 1]--;
        imos[i + 7]++;
    }
    for (int i = 0; i < 2 * n; i++) imos[i + 1] += imos[i];
    int ans = 0;
    for (int i = 0; i < n and i <= k; i++) chmax(ans, sum + imos[i] + imos[i + n]);

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    int T;
    cin >> T;
    for (; T--;) solve();
    return 0;
}