#include <bits/stdc++.h>
#define endl '\n'
#define F first
#define S second
using namespace std;
#define ll long long
#define pb push_back
#define mod 1000000007
// #define int long long
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define CheckBit(x,k)   (x & (1LL << k))
#define SetBit(x,k)     (x |= (1LL << k))
#define ClearBit(x,k)   (x &= ~(1LL << k))
#define toggleBit(x,k)  (x ^= (1LL << k))
#define LSB(mask)       __builtin_ctzll(mask)
#define MSB(mask)       63-__builtin_clzll(mask) 
#define print(x)    cout << #x << " : " << x << endl
#define error1(x)   cerr << #x << " = " << (x) <<endl
#define coutall(v)  for(auto &it: v) cout<<it<<' '; cout<<endl
#define Abid_52     ios::sync_with_stdio(false);cin.tie(0),cin.tie(0)
#define error2(a,b) cerr<<"( "<<#a<<" , "<<#b<<" ) = ( "<<(a)<<" , "<<(b)<<" )\n"
#define UNIQUE(x)   sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()
template <typename T, typename U> T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}
template <typename T, typename U> T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}

const int N = 2e5 + 10;

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<string>v;
    for(int i = 0; i < n; i++)
    {
        string s;
        cin >> s;
        v.push_back(s);
    }
    // vector<int>pre(n + 1, 0), suff(n + 1, 0);
    int pre[n + 1][m + 1], suff[n + 1][m + 1];
    for(int j = 0; j < m; j++)
    {
        int c = 0, mx = 0;
        vector<int>cnt(26, 0);
        for(int i = 0; i < n; i++)
        {
            cnt[v[i][j] - 'a']++;
            mx = max(mx, cnt[v[i][j] - 'a']);
            pre[i][j] = mx;
        }

    }
    for(int j = 0; j < m; j++)
    {
        int c = 0, mx = 0;
        vector<int>cnt(26, 0);
        for(int i = n - 1; i >= 0; i--)
        {
            cnt[v[i][j] - 'a']++;
            mx = max(mx, cnt[v[i][j] - 'a']);
            suff[i][j] = mx;
        }

    }
    ll ans = 0, tot1 = 0, tot2 = 0;
    for(int j = 0; j < m; j++)
    {
        tot1 += suff[0][j];
        tot2 += pre[n - 1][j];
    }
    ans = max(tot1, tot2);
    for(int i = 1; i  < n; i++)
    {
        ll sum1 = 0, sum2 = 0;
        for(int j = 0; j < m; j++)
        {
            sum1 += suff[i][j];
            sum2 += pre[i - 1][j];
        }
        ans = max(ans, sum1+sum2);
    }
    cout << ans << endl;
}

int32_t main()
{
    Abid_52;
    int t = 1;
    cin >> t;
    for (int tc = 1; tc <= t; ++tc)
    {
        // cout << "Case " << tc << ": ";
        solve();
    }
}