#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
struct shu{
    int x,y;
    long long z;
}a[1500];
int t,n,m,cnt=0,b[1500],ma[110],mi[110],s;
bool cmp(shu a,shu b)
{
    return a.z>b.z;
}
int main()
{
    freopen("happygameT1.in","r",stdin);
    freopen("happygameT1.out","w",stdout);
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                cnt++;
                scanf("%lld",&a[cnt].z);
                a[cnt].x=i;
                a[cnt].y=j;
            }
        }
        sort(a+1,a+cnt+1,cmp);
        long long ans=0;
        for(int i=1;i<=n;i++)
        {
            ans+=a[i].z;
        }
        printf("%lld\n",ans);
    }
    return 0;
}