#pragma comment(linker, "/STACK:1024000000,1024000000")

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<vector>

#include<map>

#include<set>

#include<queue>

#include<stack>

#include<iostream>

using namespace std;

typedef long long LL;

const double pi=acos(-1.0),eps=1e-;

void File()

{

    freopen("D:\\in.txt","r",stdin);

    freopen("D:\\out.txt","w",stdout);

}

inline int read()

{

    char c = getchar();  while(!isdigit(c)) c = getchar();

    int x = ;

    while(isdigit(c)) { x = x *  + c - ''; c = getchar(); }

    return x;

}

const int mod = ;

int exgcd(int a,int b,int &x,int &y){

    if(!b){x = ; y = ; return a;}

    else{

        int r = exgcd(b,a%b,y,x);

        y -= x * (a/b);

        return r;

    }

}

int lcm(int a,int b){

    int x = , y =;

    return a / exgcd(a,b,x,y) * b;

}

const int MAXN=;

int A[MAXN][MAXN],free_x[MAXN],x[MAXN];

void Gauss(int n,int m){

    int r,c;

    for(r=,c=;r<n && c<m;c++){

        int maxr = r;

        for(int i=r+;i<n;i++) if(abs(A[i][c]) > abs(A[maxr][c])) maxr = i;

        if(maxr != r) for(int i=c;i<=m;i++) swap(A[r][i],A[maxr][i]);

        if(!A[r][c]) continue;

        for(int i=r+;i<n;i++) if(A[i][c]){

            int d = lcm(A[i][c],A[r][c]);

            int t1 = d / A[i][c], t2 = d / A[r][c];

            for(int j=c;j<=m;j++)

                A[i][j] = ((A[i][j] * t1 - A[r][j] * t2) % mod + mod) % mod;

        }

        r++;

    }

    for(int i=r;i<n;i++) if(A[i][m]) return ;

    for(int i=r-;i>=;i--){

        x[i] = A[i][m];

        for(int j=i+;j<m;j++){

            x[i] = ((x[i] - A[i][j] * x[j]) % mod + mod) % mod;

        }

        int x1 = ,y1 = ;

        int d = exgcd(A[i][i],mod,x1,y1);

        x1 = ((x1 % mod) + mod) % mod;

        x[i] = x[i] * x1 % mod;

    }

}

void Gauss_init(){

    memset(A,,sizeof A); memset(free_x,,sizeof free_x); memset(x,,sizeof x);

}

int T,n,m;

int b[MAXN][MAXN];

bool check(int a,int b)

{

    if(a>=&&a<n&&b>=&&b<m) return ;

    return ;

}

int main()

{

    scanf("%d",&T);

    while(T--)

    {

        scanf("%d%d",&n,&m);

        for(int i=;i<n;i++) for(int j=;j<m;j++) scanf("%d",&b[i][j]);

        Gauss_init();

        for(int i=;i<n;i++) for(int j=;j<m;j++)

        {

            A[i*m+j][i*m+j]=;

            if(check(i-,j)) A[i*m+j][(i-)*m+j]=;

            if(check(i+,j)) A[i*m+j][(i+)*m+j]=;

            if(check(i,j-)) A[i*m+j][i*m+j-]=;

            if(check(i,j+)) A[i*m+j][i*m+j+]=;

            A[i*m+j][n*m]=(-b[i][j])%;

        }

        Gauss(n*m,n*m);

        int ans=; for(int i=;i<n*m;i++) ans=ans+x[i]; printf("%d\n",ans);

        for(int i=;i<n*m;i++) while(x[i]) { printf("%d %d\n",i/m+,i%m+); x[i]--; }

    }

    return ;

}