#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout <<#x<<" = "<<(x)<<endl
#define spair(p) cout <<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout <<" "<<kbrni;cout<<endl

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 100005;

vector<int> G[MAX_N];

int main()
{
    int n,m;
    cin >> n >> m;
    rep(i,m){
        int a,b;
        cin >> a >> b;
        G[min(a,b)].pb(max(a,b));
    }
    string s(n,'0');
    for(int i=n-1;i>=0;i--){
        rep(j,G[i].size()){
            if(s[G[i][j]] != '1'){
                s[i] = '1';
            }
        }
    }
    for(int i=n-1;i>=0;i--){
        if(s[i] == '1'){
            for(int j=i;j>=0;j--){
                cout << s[j];
            }
            cout << endl;
            break;
        }
    }
    return 0;
}