#include<bits/stdc++.h>
using namespace std;
map<string,string> vis;
void change(string &s,int x){
	if(s[x]<'4') ++s[x];
	else s[x]='1';
}
void bfs(string s){
	queue<string> q;
	q.push(s);
	vis[s]="";
	while(!q.empty()){
		string tmp=q.front();
		q.pop();
		if(tmp=="444444444"){
			for(auto i:vis[tmp]){
				cout<<i<<' ';
			}
			return ;
		}
		string ww=tmp;
		change(ww,0);
		change(ww,1);
		change(ww,3);
		change(ww,4);
		if(vis.find(ww)==vis.end()){
			vis[ww]=vis[tmp]+'1';
			q.push(ww);
		}
		ww=tmp;
		change(ww,0);
		change(ww,1);
		change(ww,2);
		if(vis.find(ww)==vis.end()){
			vis[ww]=vis[tmp]+'2';
			q.push(ww);
		}
		ww=tmp;
		change(ww,1);
		change(ww,2);
		change(ww,4);
		change(ww,5);
		if(vis.find(ww)==vis.end()){
			vis[ww]=vis[tmp]+'3';
			q.push(ww);
		}
		ww=tmp;
		change(ww,0);
		change(ww,3);
		change(ww,6);
		if(vis.find(ww)==vis.end()){
			vis[ww]=vis[tmp]+'4';
			q.push(ww);
		}
		ww=tmp;
		change(ww,1);
		change(ww,3);
		change(ww,4);
		change(ww,5);
		change(ww,7);
		if(vis.find(ww)==vis.end()){
			vis[ww]=vis[tmp]+'5';
			q.push(ww);
		}
		ww=tmp;
		change(ww,2);
		change(ww,5);
		change(ww,8);
		if(vis.find(ww)==vis.end()){
			vis[ww]=vis[tmp]+'6';
			q.push(ww);
		}
		ww=tmp;
		change(ww,3);
		change(ww,4);
		change(ww,6);
		change(ww,7);
		if(vis.find(ww)==vis.end()){
			vis[ww]=vis[tmp]+'7';
			q.push(ww);
		}
		ww=tmp;
		change(ww,6);
		change(ww,7);
		change(ww,8);
		if(vis.find(ww)==vis.end()){
			vis[ww]=vis[tmp]+'8';
			q.push(ww);
		}
		ww=tmp;
		change(ww,4);
		change(ww,5);
		change(ww,7);
		change(ww,8);
		if(vis.find(ww)==vis.end()){
			vis[ww]=vis[tmp]+'9';
			q.push(ww);
		}
	}
	
	return ;
}
signed main(){
	string s;
	int x;
	for(int i=1;i<=3;++i){
		for(int j=1;j<=3;++j){
			cin>>x;
			x/=3;
			s.push_back(x+'0');
		}
	}
	bfs(s);
	return 0;
}