/* Problem URL: https://codeforces.com/problemset/problem/2005/C */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

const int oo = INT32_MAX >> 1;
const ll OO = INT64_MAX >> 1;

bool inv[256];

void pre()
{
    inv['n'] = true;
    inv['a'] = true;
    inv['r'] = true;
    inv['e'] = true;
    inv['k'] = true;
}

#define TEST 1

string fd = "narek";

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

    V<string> a(n);
    cin >> a;


    vvl memo(n, vl(5, -OO));

    function<ll(int, int)> dp = [&](int i, int f) {
        if (i >= n) {
            return (ll)-f;
        }

        ll &ans = memo[i][f];
        if (ans != -OO) {
            return ans;
        }

        int pr = f;

        ans = 0;
        repv(j, a[i]) {
            if (j == fd[f]) {
                ans += 5 * (f == 4);
                f = f + 1 - 5 * (f == 4);
                continue;
            }

            ans -= inv[j];
        }

        ll tmp = -OO;
        rmax(tmp, dp(i + 1, f));

        return ans = max({ans + tmp, ans - f, dp(i + 1, pr)});
    };

    ll ans = 0;
    rep(i, n) {
        rmax(ans, dp(i, 0));
    }

    cout << ans << '\n';
}

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

    pre();

    int t;
    (TEST && cin >> t) || (t = 1);
    while (t--) {
        solve();
    }
}