#include<cstdio>#include<vector>using namespace std;int n,k,m;vector<int>base;char s[50];void getbase(){ vector<int>v; for(int i=n-1;i>=0;i--) for(int j=0;j<base.size();j++) if(base[j]&(1<<i)) { int x=base[j]; v.push_back(x); for(int k=0;k<base.size();k++) if(base[k]&(1<<i)) base[k]^=x; break; } base=v;}void out(int x){ for(int i=n-1;i>=0;i--) putchar(((1<<i)&x)?49:48);puts("");}bool jud(int x){ int j=0; for(int i=n-1;i>=0&&xi--) { if((1<<i)&x) { while(j<base.size()&&(!((1<<i)&base[j])||base[j]>=(1<<i+1))) j++; if(j==base.size()) return 0; else x^=base[j++]; } } return 1;}int main(){ while(scanf("%d%d%d",&n,&k,&m)!=EOF) { base.clear(); for(int i=0;i<k;i++) { scanf("%s",s); int x=0; for(int j=0;j<n;j++) x=(x<<1)|(s[j]-48); base.push_back(x); } getbase(); for(int i=0;i<m;i++) { scanf("%s",s); int ans=0x7fffffff,diff=100; int x=0; for(int j=0;j<n;j++) x=(x<<1)|(s[j]-48); for(int i=0;i<=n;i++) for(int j=i;j<=n;j++) for(int k=j;k<=n;k++) { int dif=(i!=n)+(j!=n)+(k!=n); int tmp=(x^(1<<i)^(1<<j)^(1<<k))&((1<<n)-1); if((dif<diff||(dif==diff&&tmp<ans))&&jud(tmp)) diff=dif,ans=tmp; } if(ans==0x7fffffff) puts("NA"); else out(ans); } } return 0;}
