#include using namespace std; long long n, m, p; string path[13][13]; bool is[13][13]; string s[16]; bool iz[13][35000]; bool alowed(string a, string b) { for (long long i=0; i=0; i--) { ans=ans+(g[i]-'0')*(1<<(g.size()-i-1)); } return ans; } long long answer=1'000'000'000'000; void dfs(long long x, string w, string maski) { //cout<>n>>m>>p; if (n==1) { cout<<0<>s[i]; } for (long long i=0; i>x>>y; string s1; cin>>s1; is[x][y]=true; is[y][x]=true; path[x][y]=s1; path[y][x]=s1; } string g; for (long long i=1; i<=p; i++) g.push_back('0'); dfs(1, s[1], g); cout<