#include<bits/stdc++.h>
using namespace std;
#define ll int
#define f(i,a,b) for(ll i=a;i<=b;i++)
ll read(){
    ll x=0,f=1;char c=getchar();
    while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
    while(isdigit(c)){x=x*10+c-'0';c=getchar();}
    return x*f;
}
#define d read()
ll n,m;
ll fa[100010],x[100010],y[100010];
ll find(ll x){if(fa[x]==x)return x;return find(fa[x]);}
ll U[1000010],V[1000010];
#define pb push_back
vector<ll>e[100010];
bitset<5010>dp;
bool ch(){
    ll s=0;dp.reset();dp[0]=1;
    f(i,1,2*n){ll t;
        if(find(i)==i)t=i;
        else if(find(i+2*n)==i+2*n)t=i+2*n;
        else continue;
        s+=min(x[t],y[t]);
        dp|=dp<<(abs(x[t]-y[t]));
    }return dp[n-s];
}
ll is[100010];
bool in[100010];
ll pre[100010];
int main(){
    n=d,m=d;
    f(i,1,2*n)fa[i]=i,x[i]=1;
    f(i,2*n+1,4*n)fa[i]=i,y[i]=1;
    f(i,1,m)U[i]=d,V[i]=d;
    for(int i=m;i>=1;i--){
        ll u=U[i],v=V[i];
        if(find(u)==find(v)||find(u)==find(v+2*n))continue;
        // f(j,1,4*n)if(find(j)==j)cout<<x[j]<<" "<<y[j]<<"\n";cout<<endl;
        ll oux=x[find(u)],ouy=y[find(u)],ovx=x[find(v)],ovy=y[find(v)];
        ll ouux=x[find(u+2*n)],ouuy=y[find(u+2*n)],ovvx=x[find(v+2*n)],ovvy=y[find(v+2*n)];
        ll ou=fa[u],ov=fa[v],ouu=fa[u+2*n],ovv=fa[v+2*n];
        
        ll uu=find(u+2*n),vv=find(v+2*n);
        u=find(u),v=find(v);
        if(x[uu]+y[uu]>x[v]+y[v])swap(uu,v);
        fa[uu]=v,x[v]=x[uu]+x[v],y[v]=y[uu]+y[v];
        if(x[u]+y[u]>x[vv]+y[vv])swap(u,vv);
        fa[u]=vv,x[vv]=x[u]+x[vv],y[vv]=y[u]+y[vv];
        if(ch()){
            // e[U[i]].pb(V[i]);
            // e[V[i]].pb(U[i]);
            // cout<<U[i]<<" "<<V[i]<<endl;
            continue;
        }
        u=U[i],v=V[i];
        x[find(u)]=oux,y[find(u)]=ouy,x[find(v)]=ovx,y[find(v)]=ovy;
        x[find(u+2*n)]=ouux,y[find(u+2*n)]=ouuy,x[find(v+2*n)]=ovvx,y[find(v+2*n)]=ovvy;
        fa[u]=ou,fa[v]=ov,fa[u+2*n]=ouu,fa[v+2*n]=ovv;
    }
    ll s=0;in[0]=1;
    f(i,1,2*n){ll t;
        if(find(i)==i)t=i;
        else if(find(i+2*n)==i+2*n)t=i+2*n;
        else continue;
        s+=min(x[t],y[t]);ll q=abs(x[t]-y[t]);
        for(int j=n-q;j>=0;j--)if(!in[j+q]&&in[j]){
            in[j+q]=1;pre[j+q]=t;
        }if(x[t]<=y[t])is[t]=1;else is[t]=2;
    }s=n-s;
    while(1){
        ll p=pre[s];is[p]=3-is[p];
        s-=abs(x[p]-y[p]);
        if(s<=0)break;
    }f(i,1,2*n){
        if(is[find(i)]==1||is[find(i+2*n)]==2)cout<<0;
        else cout<<1;
    }
    return 0;
}