//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
vector<vector<int>> ans;
int t;
vector<pii> G[100100];
map<int,int> vis;
vector<pii> res;
int deg[100100];
bool refresh(int x)
{
	while(sz(G[x])&&vis[G[x].back().second])
		G[x].pop_back();
	return sz(G[x]);
}
void dfs(int x)
{
	while(refresh(x))
	{
		int ind=G[x].back().second;
		int y=G[x].back().first;
		res[ind]=mp(x,y);
		deg[x]--;
		deg[y]--;
		vis[ind]=1;
		dfs(y);
		return ;
	}
}
vector<pii> solve(vector<pii> vec)
{
	res.resize(sz(vec));
	vis.clear();
	vector<int> node;
	for(auto pr:vec)
	{
		node.pb(pr.first);
		node.pb(pr.second);
		deg[pr.first]++;
		deg[pr.second]++;
	}
	srt(node);
	uni(node);
	for(int i=0;i<sz(vec);i++)
	{
		G[vec[i].first].pb(vec[i].second,i);
		G[vec[i].second].pb(vec[i].first,i);
	}
	for(auto x:node)
		if(deg[x]&1)
			dfs(x);
	for(auto x:node)
		while(refresh(x))
			dfs(x);
	return res;
}
void solve(vector<vector<int>> vec)
{
	int n=sz(vec),s=sz(vec[0]);
	if(s==1)
	{
		for(int i=0;i<n;i++)
			ans[i].pb(vec[i][0]);
		return ;
	}
	vector<pii> tmp;
	for(int i=0;i<n;i++)
		for(int j=0;j<s;j+=2)
			tmp.pb(vec[i][j],vec[i][j+1]);
	tmp=solve(tmp);
	vector<vector<int>> vl(n),vr(n);
	for(int i=0;i<n;i++)
		for(int j=0;j<s/2;j++)
		{
			vl[i].pb(tmp[i*(s/2)+j].first);
			vr[i].pb(tmp[i*(s/2)+j].second);
		}
	solve(vl);
	solve(vr);
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n,s;
	cin>>n>>s>>t;
	vector<vector<int>> vec(n,vector<int>(s));
	ans.resize(n);
	for(auto &arr:vec)
		for(auto &x:arr)
			cin>>x;
	solve(vec);
	for(auto arr:ans)
	{
		for(auto x:arr)
			cout<<x<<" ";
		cout<<'\n';
	}
	return 0;
}