#include<bits/stdc++.h>
using namespace std;
int kk=-1e9+7;
vector<int>SegTree(4*100005,kk);
vector<int>SegTree2(4*100005,kk);
bool comp(pair<int,pair<int,int>>&abc,pair<int,pair<int,int>>&def)
{
    if(abc.first==def.first)
    {
        return abc.second.first<def.second.first;
    }
    return abc.first<def.first;
}
void update(int start,int end,int Tree_index,int qstart,int qend,int val)
{
    if(end<qstart || qend<start)
    {
        return;
    }
    if(qstart<=start && qend>=end)
    {
        SegTree[Tree_index]=val;
        return;
    }
    int mid=(start+end)/2;
    update(start,mid,2*Tree_index+1,qstart,qend,val);
    update(mid+1,end,2*Tree_index+2,qstart,qend,val);
}
void update2(int start,int end,int Tree_index,int qstart,int qend,int val)
{
    if(end<qstart || qend<start)
    {
        return;
    }
    if(qstart<=start && qend>=end)
    {
        SegTree2[Tree_index]=val;
        return;
    }
    int mid=(start+end)/2;
    update2(start,mid,2*Tree_index+1,qstart,qend,val);
    update2(mid+1,end,2*Tree_index+2,qstart,qend,val);
}
int query(int start,int end,int Tree_index,int qstart,int qend)
{
    if(end<qstart || qend<start)
    {
        return kk;
    }
    if(qstart<=start && qend>=end)
    {
        return SegTree[Tree_index];
    }
    int mid=(start+end)/2;
    return max(query(start,mid,2*Tree_index+1,qstart,qend),query(mid+1,end,2*Tree_index+2,qstart,qend));
}
int query2(int start,int end,int Tree_index,int qstart,int qend)
{
    if(end<qstart || qend<start)
    {
        return kk;
    }
    if(qstart<=start && qend>=end)
    {
        return SegTree2[Tree_index];
    }
    int mid=(start+end)/2;
    return max(query2(start,mid,2*Tree_index+1,qstart,qend),query2(mid+1,end,2*Tree_index+2,qstart,qend));
}
int main()
{
    int test;
    cin>>test;
    while(test--)
    {
    int row,col;
    cin>>row>>col;
    vector<vector<int>>input(row,vector<int>(col));
    vector<vector<int>>output(row,vector<int>(col));
    vector<pair<int,pair<int,int>>>temp;
    for(int i=0;i<row;++i)
    {
        for(int j=0;j<col;++j)
        {
            cin>>input[i][j];
            temp.push_back({input[i][j],{i,j}});
        }
    }
    sort(temp.begin(),temp.end(),comp);
    int pk=1,prev;
    for(int i=0;i<temp.size();++i)
    {
        int x=temp[i].second.first,y=temp[i].second.second;
        int curr_row_start=col*x+1;
        int curr_row_end=col*(x+1);
        int curr_col_start=row*y+1;
        int curr_col_end=row*(y+1);
        //cout<<"++++++++++++++++++++++++++++++++++++++"<<endl;
        //cout<<curr_row_start<<" :: "<<curr_row_end<<endl;
        //cout<<curr_col_start<<" :: "<<curr_col_end<<endl;
        //cout<<temp[i].first<<" index "<<x<<" :: "<<y<<endl;
        if(i==0)
        {
            output[x][y]=pk;
            update(1,row*col,0,curr_row_start,curr_row_end,pk);
            update2(1,row*col,0,curr_col_start,curr_col_end,pk);
            prev=temp[i].first;
        }
        else
        {
            if(temp[i].first==prev)
            {
                update(1,row*col,0,curr_row_start,curr_row_end,pk);
                update2(1,row*col,0,curr_col_start,curr_col_end,pk);
                output[x][y]=pk;
            }
            else
            {
                int ss=query(1,row*col,0,curr_row_start,curr_row_end);
              //  cout<<"ss "<<ss<<endl;
                int zz=query2(1,row*col,0,curr_col_start,curr_col_end);
                //cout<<"zz "<<zz<<endl;
                if(ss==zz && ss==kk)
                {
                    update(1,row*col,0,curr_row_start,curr_row_end,pk);
                    update2(1,row*col,0,curr_col_start,curr_col_end,pk);
                    output[x][y]=pk;
                }
                else
                {
                    pk=max(ss,zz)+1;
                    output[x][y]=pk;
                    update(1,row*col,0,curr_row_start,curr_row_end,pk);
                    update2(1,row*col,0,curr_col_start,curr_col_end,pk);
                }
                prev=temp[i].first;
            }
        }
        //cout<<output[x][y]<<endl;
    }
  //  cout<<"+++++++++++++++++++++++++"<<endl;
    for(int i=0;i<row;++i)
    {
        for(int j=0;j<col;++j)
        {
            cout<<output[i][j]<<" ";
        }
        cout<<endl;
    }
    }
    return 0;
}
