#include<bits/stdc++.h>
using namespace std;
int l[6][6];
int correct[6];
int answer[6];
//void dfs(int a,int r);
bool trued(int a);
int main(){
//ios::sync_with_stdio(0);
//cin.tie(0);
memset(answer,0,sizeof(answer));
for(int i=0;i<6;++i){
for(int j=0;j<6;++j) cin>>l[i][j];
cin>>correct[i];
}
int a=0,r=1;
bool f2[100];
memset(f2,0,sizeof(f2));
while(1){
if(a>5) break;
while(r<=6&&f2[r-1]) r++;
if(r>6)
{
answer[a]=0;
//f[a]=0;
a--;
r=answer[a];
f2[r-1]=0;
r++;
continue;
}
answer[a]=r;
f2[r-1]=1;
if(trued(a)){
a++;
r=1;

}
else{
f2[r-1]=0;
answer[a]=0;
a--;
r=answer[a];
f2[r-1]=0;
r++;
}

}
for(auto i:answer){ cout<<i<<" ";
}
cout<<"\n";
}
inline bool trued(int a){
/*for(int i=0;i<6;i++) {
if(count(answer,answer+6,i)>1) return 0;
}
cout<<a<<"\n";*/
for(int i=0;i<6;i++){
int k=0;
for(int j=0;j<6;j++){
if(answer[j]==l[i][j]) k++;
}
if((k!=correct[i]&&a==5)||k>correct[i]) return 0;
}
//cout<<"return true";
return 1;
}