#include<cstdio>
using namespace std;

const long long mod=1LL<<32;
int n,m,a[1010][1010],f[1010][1010][4];

void work()
{
    scanf("%d%d",&n,&m);
    for(int i = 1;i <= n;i++)
        for(int j = 1;j <= m;j++)
            scanf("%d",&a[i][j]);
    for(int i = 1;i <= n;i++)
        for(int j = 1;j <= m;j++)
        {
            int k=j-1;
            while(k && a[i][k]>a[i][j])k=f[i][k][0];
            f[i][j][0]=k;
            k=i-1;
            while(k && a[k][j]<a[i][j])k=f[k][j][1];
            f[i][j][1]=k;
        }
    for(int i = n;i > 0;i--)
        for(int j = m;j > 0;j--)
        {
            int k=j+1;
            while(k<=m && a[i][k]>a[i][j])k=f[i][k][2];
            f[i][j][2]=k;
            k=i+1;
            while(k<=n && a[k][j]<a[i][j])k=f[k][j][3];
            f[i][j][3]=k;
        }
    long long ans=0;
    for(int i = 1;i <= n;i++)
        for(int j = 1;j <= m;j++)
        {
            f[i][j][0]=j-f[i][j][0];
            f[i][j][1]=i-f[i][j][1];
            f[i][j][2]=f[i][j][2]-j;
            f[i][j][3]=f[i][j][3]-i;
            long long l1=f[i][j][0],r1=f[i][j][2],l2=f[i][j][1],r2=f[i][j][3];
            ans+=(long long)a[i][j]*l1*r1*(l1+r1)/2%mod*l2*r2*(l2+r2)/2%mod;
            ans%=mod;
        }
    printf("%I64d\n",ans);
}

int main(){
    int t;
    scanf("%d",&t);
    while(t--)work();
    return 0;
}