#include<bits/stdc++.h>
using namespace std;
//#define int long long
//#define mod 1000000007
#define N 100005
//#define pii pair<int,int>
//#define fi first
//#define se second
//#define rep(i,j,k) for(int i=j;i<=k;i++)
int n,s,t;
vector<int>a[N];
int tot;
bool vis[N*10];
vector<int>mp[N],ma[N],mb[N];
int cur[N];
int bc[N];
mt19937 rd(random_device{}());
void adde(int u,int v,int w){
	tot++;
	vis[tot]=0;
	mp[u].push_back(v),ma[u].push_back(tot),mb[u].push_back(w);
	mp[v].push_back(u),ma[v].push_back(tot),mb[v].push_back(w);
}
int ans[N];
void sol(int l,int r){
	if(l==r)return;
	int mid=(l+r)>>1;
	queue<int>q;
	for(int i=1;i<=n;i++){
		for(int j=0;j<=mid-l;j++){
			adde(a[i][l+j],a[i][mid+1+j],i);
			q.push(a[i][l+j]),q.push(a[i][mid+1+j]);
			// cout<<a[i][l+j]<<' '<<a[i][mid+1+j]<<endl;
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=l;j<=r;j++){
			if(mp[a[i][j]].size()&1){
				adde(0,a[i][j],0);
			}
		}
	}
	function<void(int)> dfs=[&](int u){
		for(int &i=cur[u];i<mp[u].size();){
			int v=mp[u][i],rt=ma[u][i],w=mb[u][i];
			i++;
			if(vis[rt])continue;
			vis[rt]=1;
			if(u&&v){a[w][l+bc[w]]=u,a[w][mid+1+bc[w]]=v;bc[w]++;}
			dfs(v);
		}
	};
	while(q.size())dfs(q.front()),q.pop();
	dfs(0);
	tot=0;
	cur[0]=0;
	mp[0].clear(),ma[0].clear(),mb[0].clear();
	for(int i=1;i<=n;i++){
		bc[i]=0;
		for(int j=l;j<=r;j++){
			cur[a[i][j]]=0;
			mp[a[i][j]].clear();
			ma[a[i][j]].clear();
			mb[a[i][j]].clear();
		}
	}
	sol(l,mid),sol(mid+1,r);
}
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>s>>t;
	for(int i=1;i<=n;i++){
		a[i].resize(s+5);
		for(int j=1;j<=s;j++)cin>>a[i][j];
	}
	sol(1,s);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=s;j++)cout<<a[i][j]<<' ';cout<<'\n';
	}
	return 0;
}