#include <iostream>
#include <algorithm>
using namespace std;
char c[20];
int main() {
	long long n, m, i, j, k, mini, a, b;
	cin>>n>>m;
	cin.get();
	for(i=1; i<=n; ++i)
	{
		for(j=1; j<=m; ++j)
		{
			for(k=0; k<7; ++k)
				cin.get(c[k]);
			cout<<'#';
			for(k=0; k<3; ++k)
			{
				if('0'<=c[k*2+1] && c[k*2+1]<='9')
					a=c[k*2+1]-'0';
				else a=c[k*2+1]-55;
				if('0'<=c[k*2+2] && c[k*2+2]<='9')
					b=c[k*2+1]-'0';
				else b=c[k*2+2]-55;
				mini=a;
				if( (a*256+b*16-mini*256-mini*16)*(a*256+b*16-mini*256-mini*16) > ( (mini+1)*256+(mini+1)*16- a*256-b*16 ) *( (mini+1)*256+(mini+1)*16- a*256-b*16 ) )
					mini=mini+1;
				if(mini>9)
					cout<<char(mini+55);
				else cout<<mini;
				//cout<<c[k*2+1]<<' '<<b<<' ';
			}
			if(j<m) cout<<' ';
			cin.get();
		}
		cout<<'\n';
	}
	return 0;
}