#include <cstdio>
#include <algorithm>
#include <cstring>

#define rep(i, l, r) for(int i=l; i<=r; i++)
#define dow(i, l, r) for(int i=l; i>=r; i--)
#define clr(x, c) memset(x, c, sizeof(x))
#define travel(x) for(edge *p=fir[x]; p; p=p->n)
#define all(x) (x).begin,(x).end
#define pb push_back
#define fi first
#define se second
#define l(x) Left[x]
#define r(x) Right[x]
#define lowbit(x) (x&-x)

using namespace std;

typedef long long ll;
typedef pair<int,int> Pii;
typedef long double ld;
typedef unsigned int ull;

inline int read()
{
    int x=0; bool f=0; char ch=getchar();
    while (ch<'0' || '9'<ch) f|=ch=='-', ch=getchar();
    while ('0'<=ch && ch<='9') x=x*10+ch-'0', ch=getchar();
    return f?-x:x;
}

#define maxn 1009
#define inf 0x7fffffff

int n, m, L[maxn][maxn], R[maxn][maxn], U[maxn][maxn], D[maxn][maxn];
ull Ans, k[maxn][maxn], p[maxn][maxn], g[maxn], s[maxn];
int q[maxn], top;

int main()
{
    rep(i, 1, 1000) g[i]=g[i-1]+i*i;
    rep(i, 1, 1000) s[i]=s[i-1]+i;
    rep(i, 1, 1000) dow(j, i, 1) p[i][j]=p[i][j+1]+j*(i+1-j);
    
    int t=read(); while (t--)
    {
        n=read(); m=read();
        rep(i, 1, n) rep(j, 1, m) k[i][j]=read();
        rep(i, 1, n)
        {
            q[top=0]=0; rep(j, 1, m)
            {
                while (top && k[i][q[top]]>k[i][j]) top--;
                L[i][j]=j-q[top], q[++top]=j;
            }
        }
        rep(i, 1, n)
        {
            q[top=0]=m+1; dow(j, m, 1)
            {
                while (top && k[i][q[top]]>k[i][j]) top--;
                R[i][j]=q[top]-j, q[++top]=j;
            }
        }
        rep(j, 1, m)
        {
            q[top=0]=0; rep(i, 1, n)
            {
                while (top && k[q[top]][j]<k[i][j]) top--;
                U[i][j]=i-q[top], q[++top]=i;
            }
        }
        rep(j, 1, m)
        {
            q[top=0]=n+1; dow(i, n, 1)
            {
                while (top && k[q[top]][j]<k[i][j]) top--;
                D[i][j]=q[top]-i, q[++top]=i;
            }
        }
        Ans=0; rep(i, 1, n) rep(j, 1, m)
        {
            int a=min(L[i][j],R[i][j]), b=max(L[i][j],R[i][j]);
            int c=min(U[i][j],D[i][j]), d=max(U[i][j],D[i][j]);
            Ans+=k[i][j]*(g[a]+(s[b-1]-s[a])*a+p[a+b-1][b])*(g[c]+(s[d-1]-s[c])*c+p[c+d-1][d]);
        }
        printf("%u\n", Ans);
    }
    return 0;
}