#include <bits/stdc++.h>
// #include <windows.h>
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
using namespace std;
//#pragma GCC optimize(3)
#define DB double
#define LL long long
#define ULL unsigned long long
#define in128 __int128
#define cint const int
#define cLL const LL
#define For(z,e1,e2) for(int z=(e1);z<=(e2);z++)
#define Rof(z,e1,e2) for(int z=(e2);z>=(e1);z--)
#define For_(z,e1,e2) for(int z=(e1);z<(e2);z++)
#define Rof_(z,e1,e2) for(int z=(e2);z>(e1);z--)
#define inint(e) scanf("%d",&e)
#define inll(e) scanf("%lld",&e)
#define inpr(e1,e2) scanf("%d%d",&e1,&e2)
#define in3(e1,e2,e3) scanf("%d%d%d",&e1,&e2,&e3)
#define outint(e) printf("%d\n",e)
#define outint_(e) printf("%d%c",e," \n"[i==n])
#define outint2_(e,e1,e2) printf("%d%c",e," \n"[(e1)==(e2)])
#define outll(e) printf("%lld\n",e)
#define outll_(e) printf("%lld%c",e," \n"[i==n])
#define outll2_(e,e1,e2) printf("%lld%c",e," \n"[(e1)==(e2)])
#define exc(e) if(e) continue
#define stop(e) if(e) break
#define ret(e) if(e) return
#define ll(e) (1ll*(e))
#define pb push_back
#define ft first
#define sc second
#define pii pair<int,int> 
#define pli pair<LL,int> 
#define vct vector 
#define clean(e) while(!e.empty()) e.pop()
#define all(ev) ev.begin(),ev.end()
#define sz(ev) ((int)ev.size())
#define debug(x) printf("%s=%d\n",#x,x)
#define x0 __xx00__
#define y1 __yy11__
#define ffo fflush(stdout)
// cLL mod=998244353,G=404;
cLL mod=188888888861ll;
// cLL mod[2]={1686688681ll,1666888681ll},base[2]={166686661ll,188868881ll};
template <typename Type> void get_min(Type &w1,const Type w2) { if(w2<w1) w1=w2; } template <typename Type> void get_max(Type &w1,const Type w2) { if(w2>w1) w1=w2; }
template <typename Type> Type up_div(Type w1,Type w2) { return (w1/w2+(w1%w2?1:0)); }
template <typename Type> Type gcd(Type X_,Type Y_) { Type R_=X_%Y_; while(R_) { X_=Y_; Y_=R_; R_=X_%Y_; } return Y_; } template <typename Type> Type lcm(Type X_,Type Y_) { return (X_/gcd(X_,Y_)*Y_); }
template <typename Type> Type md(Type w1,const Type w2=mod) { w1%=w2; if(w1<0) w1+=w2; return w1; } template <typename Type> Type md_(Type w1,const Type w2=mod) { w1%=w2; if(w1<=0) w1+=w2; return w1; }
void ex_gcd(LL &X_,LL &Y_,LL A_,LL B_) { if(!B_) { X_=1ll; Y_=0ll; return ; } ex_gcd(Y_,X_,B_,A_%B_); X_=md(X_,B_); Y_=(1ll-X_*A_)/B_; } LL inv(LL A_,LL B_=mod) { LL X_=0ll,Y_=0ll; ex_gcd(X_,Y_,A_,B_); return X_; }
template <typename Type> void add(Type &w1,const Type w2,const Type M_=mod) { w1=md(w1+w2,M_); } void mul(LL &w1,cLL w2,cLL M_=mod) { w1=md(w1*md(w2,M_),M_); } template <typename Type> Type pw(Type X_,Type Y_,Type M_=mod) { Type S_=1; while(Y_) { if(Y_&1) mul(S_,X_,M_); Y_>>=1; mul(X_,X_,M_); } return S_; }
template <typename Type> Type bk(vector <Type> &V_) { auto T_=V_.back(); V_.pop_back(); return T_; } template <typename Type> Type tp(stack <Type> &V_) { auto T_=V_.top(); V_.pop(); return T_; } template <typename Type> Type frt(queue <Type> &V_) { auto T_=V_.front(); V_.pop(); return T_; }
template <typename Type> Type bg(set <Type> &V_) { auto T_=*V_.begin(); V_.erase(V_.begin()); return T_; } template <typename Type> Type bk(set <Type> &V_) { auto T_=*prev(V_.end()); V_.erase(*prev(V_.end())); return T_; }
mt19937 gen(time(NULL)); int rd() { return abs((int)gen()); }
int rnd(int l,int r) { return rd()%(r-l+1)+l; }
void main_init()
{
}
cint N=5010,Q_=1.02e6;
int n,Q;
int uf[N<<1],siz1[N<<1],siz2[N<<1];
bool ck[N<<1];
array <int,2> q[Q_];
pair<int,bool> fin(int w)
{
    if(uf[w]==w) return {w,false};
    auto [w2,f]=fin(uf[w]);
    return {uf[w]=w2,ck[w]^=f};
}
void mer(int w1,int w2,bool f)
{
    // printf("merge %d %d (%d)\n",w1,w2,f);
    w1=fin(w1).ft,w2=fin(w2).ft;
    ret(w1==w2);
    if(w1>w2) swap(w1,w2);
    if(f) siz1[w1]+=siz2[w2],siz2[w1]+=siz1[w2];
    else siz1[w1]+=siz1[w2],siz2[w1]+=siz2[w2];
    // printf("%d->%d\n",w2,w1);
    uf[w2]=w1,ck[w2]=f;
}
LL dp[N<<1];
int m;
void ins(int x,int y)
{
    m+=min(x,y);
    int t=abs(x-y);
    ret(!t);
    Rof(i,t,n<<1)
    {
        dp[i]+=dp[i-t];
        if(dp[i]>=mod) dp[i]-=mod;
    }
}
void ers(int x,int y)
{
    m-=min(x,y);
    int t=abs(x-y);
    ret(!t);
    For(i,t,n<<1)
    {
        dp[i]-=dp[i-t];
        if(dp[i]<0ll) dp[i]+=mod;
    }
}
bool gt()
{
    // printf("get %d:%lld\n",m,dp[n-m]);
    return (dp[n-m]!=0ll);
}
bool check(int i,int j,bool f)
{
    int x1=siz1[i],y1=siz2[i];
    int x2=siz1[j],y2=siz2[j];
    if(f) swap(x2,y2);
    // printf("%d,%d & %d,%d\n",x1,y1,x2,y2);
    ers(x1,y1),ers(x2,y2);
    ins(x1+x2,y1+y2);
    if(gt())
    {
        mer(i,j,f);
        return true;
    }
    ers(x1+x2,y1+y2);
    ins(x1,y1),ins(x2,y2);
    // printf("> m=%d\n",m);
    return false;
}
int b[N<<1][N];
bool ans[N<<1];
void main_solve()
{
    inpr(n,Q);
    For(i,1,Q) inpr(q[i][0],q[i][1]);
    reverse(q+1,q+Q+1);
    dp[0]=1ll; m=0;
    For(i,1,n<<1) uf[i]=i,siz1[i]=1,siz2[i]=0,ck[i]=false;
    For(i,1,n<<1) ins(1,0);
    For(qid,1,Q)
    {
        auto [x,y]=q[qid];
        exc(fin(x).ft==fin(y).ft);
        // printf("%d(%d),%d(%d)\n",x,fin(x).ft,y,fin(y).ft);
        bool f=!(ck[x]^ck[y]); x=fin(x).ft,y=fin(y).ft;
        if(!check(x,y,f)) assert(check(x,y,!f));
        // printf("m=%d\n",m);
        // For(i,0,n<<1) printf("%lld ",dp[i]); printf("\n");
        assert(gt());
    }
    For(i,1,n<<1) fin(i);
    b[0][0]=-1;
    int tot=0;
    For(i,1,n<<1)
    {
        exc(fin(i).ft!=i);
        int t=abs(siz1[i]-siz2[i]);
        For(j,0,t) if(b[tot][j]) b[tot+1][j]=j+1;
        For(j,t,n) if(b[tot][j-t]) b[tot+1][j]=j-t+1;
        tot++;
    }
    int k=n-m;
    Rof(i,1,n<<1)
    {
        exc(fin(i).ft!=i);
        // printf("k=%d\n",k);
        ans[i]=(b[tot][k]==k+1); k=b[tot--][k]-1;
    }
    For(i,1,n<<1) printf("%d",ck[i]^ans[fin(i).ft]); printf("\n");
}
int main()
{
    // ios::sync_with_stdio(0); cin.tie(0);
    // freopen("in.txt","r",stdin);
    // freopen("out.txt","w",stdout);
    // srand(time(NULL));
    main_init();
    // int _; inint(_); For(__,1,_) // T>1 ?
        // printf("\n------------\n\n"),
        main_solve();
    return 0;
}
/*

*/