#include<bits/stdc++.h>

using namespace std;

// 参考:全探索O(2^n)

int main(){
    int n,m;
    int i,j,k;
    int a,b;
    
    cin >> n>>m;
    assert(2<=n && n<=150);
    assert((n+1)/2<=m && m<=n*(n-1)/2 && m<=1000);
    
    vector<vector<int>> vertex(n);
    
    for (i=0;i<m;i++){
        scanf("%d%d",&a,&b);
        assert(0<=a && a<n);
        assert(0<=b && b<n);
        assert(a<=b);
        // edgeset[i][1]=b;
        // edgeset[i][0]=a;
        vertex[a].emplace_back(i);
        vertex[b].emplace_back(i);
    }
    
    
    if (15<n){
        cout<<"surrender"<<endl;
        return 0;
    }
    
    int result=-1;
    for (int bits=0;bits < 1<<n;bits++){
        vector<bool> check(m,false);
        int count = 0;
        for (i=0;0 < bits>>i;i++){
            if ((bits>>i)&1){
                for(int e:vertex[i]){
                    if (!check[e]){
                        check[e]=true;
                        count++;
                    }
                }
            }
        }
        if (count==m){
            result = bits;
            break;
        }
    }
    
    // cout << result << endl;
    
    stack<char> stack;
    while (result){
        stack.push((result&1)+'0');
        result>>=1;
    }
    while (!stack.empty()){
        cout << stack.top();
        stack.pop();
    }
    cout << endl;

    return 0;
}