#include<iostream>
#include<cstdio>
#include<algorithm>

using namespace std;

const int maxn = 105;
const int INF = 0x7fffffff;

int T;
int n, m, maxval, ans;

int a[maxn][maxn];

int val[maxn];

int read(void)
{
    int s = 0, w = 1;
    char ch = getchar();
    for(; ch < '0' || ch > '9'; ch = getchar()) if(ch == '-') w = -1;
    for(; ch <= '9' && ch >= '0'; ch = getchar()) s = s * 10 + ch - '0';
    return s * w;
}

bool cmp(int rr, int tt)
{
    return rr > tt;
}

int main()
{
    freopen("happygameT1.in", "r", stdin);
    freopen("happygameT1.out", "w", stdout);
    T = read();
    for(; T; T--)
    {
        n = read(); m = read();
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++) a[i][j] = read();
        for(int i = 1; i <= m; i++)
        {
            maxval = -INF;
            for(int j = 1; j <= n; j++) maxval = max(maxval, a[j][i]);
            val[i] = maxval;
        }
        sort(val + 1, val + m + 1, cmp);
        ans = 0;
        for(int i = 1; i <= n; i++) ans += val[i];
        cout << ans << '\n';
    }
    return 0;
}