#include <bits/stdc++.h>
#define N 500011
#define ID(i,j) (((i)-1)*S+(j))
using namespace std;
int n,S,T;
struct edge{int v,t,i,j,r,next;edge(){}edge(int _v,int _t,int _i,int _j,int _next){v=_v;t=_t;i=_i;j=_j;next=_next;r=0;}}e[N*2];int head[N],cur[N],sz;
void insert(int u,int v,int i,int j){e[++sz]=edge(v,1,i,j,head[u]);head[u]=sz;}
vector<vector<int>> ans;
void dfs0(int u)
{
	for(int &i=cur[u];~i;i=e[i].next)
	{
		if(!e[i].t)continue;
		e[i].r=1;e[i].t=e[i^1].t=0;
		e[i^1].t=0;
		dfs0(e[i].v);
		break;
	}
}
void dfs(int u)
{
	for(int &i=cur[u];~i;i=e[i].next)
	{
		if(!e[i].t)continue;
		e[i].r=1;e[i].t=e[i^1].t=0;
		e[i^1].t=0;
		dfs(e[i].v);
	}
}
int deg[N];
void solve(int L,int R,vector<vector<int>> a)
{
	if(L==R)
	{
		for(int i=0;i<n;++i)ans[i][L]=a[i][0];
		return;
	}
	vector<vector<int>> al(n,vector<int>()),ar(n,vector<int>());
	static vector<int> vv;vv.clear();
	for(auto v:a)for(int x:v)head[x]=-1,vv.push_back(x),deg[x]=0;sz=-1;
	sort(vv.begin(),vv.end());vv.resize(unique(vv.begin(),vv.end())-vv.begin());
	for(int i=0;i<n;++i)
	{
		for(int j=0;j<a[i].size();j+=2)
		{
			insert(a[i][j],a[i][j+1],i,j);insert(a[i][j+1],a[i][j],i,j+1);
			++deg[a[i][j]];++deg[a[i][j+1]];
		}
	}
	for(int x:vv)cur[x]=head[x];
	for(int x:vv)if(deg[x]&1)dfs0(x);
	for(int x:vv)dfs(x);
	for(int x:vv)for(int i=head[x];~i;i=e[i].next)if(e[i].r)
	{
		al[e[i].i].push_back(a[e[i].i][e[i].j]),ar[e[i].i].push_back(a[e[i].i][e[i].j^1]);
	}
	solve(L,L+R>>1,al);solve((L+R>>1)+1,R,ar);
}
int main()
{
	scanf("%d%d%d",&n,&S,&T);
	vector<vector<int>> a(n,vector<int>(S,0));ans=a;
	for(int i=0;i<n;++i)for(int j=0;j<S;++j)scanf("%d",&a[i][j]);
	solve(0,S-1,a);
	for(int i=0;i<n;++i){for(int j=0;j<S;++j)printf("%d ",ans[i][j]);putchar(10);}
}