#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<set>
#include<map>
#include<bitset>

using namespace std;
typedef long long ll;
#define i_7 1000000007
#define i_5 1000000005

ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    else return c+i_7;
}
typedef pair<int,int> i_i;
typedef pair<ll,ll> l_l;
ll inf=1000000000000;/*10^12*/
#define rep(i,l,r) for(ll i=l;i<=r;i++)
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}


//////////////////////////////////////

int main(){
    int n,m;cin>>n>>m;
    vector<int> e[n];
    rep(i,0,m-1){
        int a,b;cin>>a>>b;
        e[a].push_back(b);
        e[b].push_back(a);
    }
    bool deleted[n];memset(deleted,false,sizeof(deleted));
    for(int v=n-1;v>=0;v--){
        bool flag=true;
        for(auto x:e[v]){
            if(deleted[x])flag=false;
        }
        if(flag)deleted[v]=true;
    }
    int pos=n-1;
    while(pos>=0&&deleted[pos])pos--;
    while(pos>=0){
        if(!deleted[pos])cout<<1;
        else cout<<0;
        pos--;
    }
    cout<<endl;
    
    return 0;
}