#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#include<ext/pb_ds/priority_queue.hpp>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MP make_pair
#define pii pair<int,int>
template <class Miaowu>
inline void in(Miaowu &x){
	char c;x=0;bool f=0;
	for(c=getchar();c<'0'||c>'9';c=getchar())f|=c=='-';
	for(;c>='0'&&c<='9';c=getchar())x=(x<<1)+(x<<3)+(c^48);
	x=f?-x:x;
}
const int N=5e5+5;
bool tr[N];
char ans[N];
vector<int>vc1[N],vc2[N];
int T,n,m,tot,fn,c1,head[N],uu[N],vv[N],cc[N],son[N],dfn[N],siz[N],de[N],ST[21][N],lg[N],sn[N],top[N],F[21][N],ST2[21][N],ccc[N],val[N];
struct Edge{int to,nxt,id;}e[N<<1];
inline void dfs(int u,int fa){
	de[u]=de[fa]+1,siz[u]=1;
	for(int i=head[u];i;i=e[i].nxt){
		int v=e[i].to;
		if(v==fa)continue;
		if(!de[v]){
			if(u==1)c1++;
			ccc[u]++;
			tr[e[i].id]=1;
			dfs(v,u),siz[u]+=siz[v];
			if(siz[v]>siz[sn[u]])sn[u]=v;
		}
	}
}
inline void dfs2(int u,int fa){
	dfn[u]=++fn,F[0][u]=fa;
	if(sn[u])top[sn[u]]=top[u],dfs2(sn[u],u);
	for(int i=head[u];i;i=e[i].nxt){
		int v=e[i].to;
		if(de[v]<de[u]&&v!=fa){
			if(de[v]<ST[0][dfn[u]])ST2[0][dfn[u]]=ST[0][dfn[u]],ST[0][dfn[u]]=de[v];
			else ST2[0][dfn[u]]=min(ST2[0][dfn[u]],de[v]);
		}
		if(v==sn[u]||de[v]!=de[u]+1)continue;
		top[v]=v,dfs2(v,u);
	}
}
struct SGT{
	int ind,rt[N],ls[N<<5],rs[N<<5],siz[N<<5];
	inline void clear(){
		for(int i=0;i<=ind;i++)ls[i]=rs[i]=siz[i]=0;
		memset(rt,0,sizeof rt);
		ind=0;
	}
	inline void upd(int &u,int l,int r,int x){
		if(!u)u=++ind;
		siz[u]++;
		if(l==r)return;
		int mid=l+r>>1;
		mid>=x?upd(ls[u],l,mid,x):upd(rs[u],mid+1,r,x);
	}
	inline int binary(int u,int l,int r,int x){
		if(!u||!siz[u])return 0;
		if(l==r)return (l<x?l:0);
		int mid=l+r>>1;
		if(r<x){
			if(siz[rs[u]])return binary(rs[u],mid+1,r,x);
			return binary(ls[u],l,mid,x);
		}
		if(mid<x){
			int qwq=binary(rs[u],mid+1,r,x);
			if(!qwq)qwq=binary(ls[u],l,mid,x);
			return qwq;
		}
		return binary(ls[u],l,mid,x);
	}
	inline int merge(int u,int v){
		if(!u||!v)return u^v;
		ind++;int qq=ind;
		siz[qq]=siz[u]+siz[v];
		ls[qq]=merge(ls[u],ls[v]);
		rs[qq]=merge(rs[u],rs[v]);
		return qq;
	}
}sgt;
inline void dfs3(int u,int fa){
	for(int i=head[u];i;i=e[i].nxt){
		int v=e[i].to;
		if(de[v]!=de[u]+1){
			if(v!=fa&&de[v]<de[u]){
				sgt.upd(sgt.rt[u],1,n,de[v]);
			}
		}
		else{
			dfs3(v,u);
			val[u]=min(val[u],val[v]);
			vc1[u].push_back(val[v]);
			vc2[u].push_back(sgt.binary(sgt.rt[v],1,n,de[u]));
			sgt.rt[u]=sgt.merge(sgt.rt[u],sgt.rt[v]);
		}
	}
}
inline int qry(int l,int r){
	int k=lg[r-l+1];
	return min(ST[k][l],ST[k][r-(1<<k)+1]);
}
inline int qry2(int l,int r){
	int k=lg[r-l+1];
	return min(ST2[k][l],ST2[k][r-(1<<k)+1]);
}
inline int jump(int u,int stp){
	for(int i=20;i>=0;i--)
		if(stp>>i&1)u=F[i][u];
	return u;
}
inline int get(int lst,int u,int v){
	int res=1e9;
	while(1){
		if(de[top[u]]>de[v]){
			int l=dfn[top[u]],r=dfn[top[u]]+siz[top[u]]-1;
			int _l=dfn[lst],_r=dfn[lst]+siz[lst]-1;
			if(l<_l)res=min(res,qry(l,_l-1));
			if(_r<r)res=min(res,qry(_r+1,r));
			lst=top[u],u=F[0][top[u]];
		}
		int l=dfn[v],r=dfn[v]+siz[v]-1;
		int _l=dfn[lst],_r=dfn[lst]+siz[lst]-1;
		if(l<_l)res=min(res,qry(l,_l-1));
		if(_r<r)res=min(res,qry(_r+1,r));
		return res;
	}
}
map<int,int>mp[N];
int main(){
	// freopen("wxdx.in","r",stdin);
	// freopen("wxdx.out","w",stdout);
	for(int i=2;i<N;i++)lg[i]=lg[i>>1]+1;
	for(T=1;T;T--){
		in(n),in(m);
		memset(ST,0x3f,sizeof ST);
		memset(ST2,0x3f,sizeof ST2);
		memset(F,0,sizeof F);
		for(int i=1,u,v;i<=m;i++){
			in(u),in(v);uu[i]=u,vv[i]=v;
			e[++tot]=Edge{v,head[u],i},head[u]=tot;
			e[++tot]=Edge{u,head[v],i},head[v]=tot;
		}
		for(int i=1;i<=n;i++)mp[i].clear();
		dfs(1,0),top[1]=1,dfs2(1,0);
		for(int i=1;i<21;i++)for(int j=1;j+(1<<i)-1<=n;j++)
			ST[i][j]=min(ST[i-1][j],ST[i-1][j+(1<<i-1)]),ST2[i][j]=min(ST2[i-1][j],ST2[i-1][j+(1<<i-1)]);
		for(int i=1;i<21;i++)for(int j=1;j<=n;j++)
			F[i][j]=F[i-1][F[i-1][j]];
		for(int u=1;u<=n;u++){
			for(int i=head[u];i;i=e[i].nxt){
				int v=e[i].to;
				if(de[v]==de[u]+1){
					int qwq=qry(dfn[v],dfn[v]+siz[v]-1);
					if(qwq>=de[u]){
						cc[u]++,son[u]=v;
					}
					val[v]=qwq;
					int qwq2=qry2(dfn[v],dfn[v]+siz[v]-1);
					if(qwq2>=de[u])mp[u][qwq]=1;
				}
			}
		}
		for(int i=1;i<=n;i++)vc1[i].clear(),vc2[i].clear();
		sgt.clear(),val[1]=1e9,dfs3(1,0);
		for(int i=1;i<=n;i++){
			stable_sort(vc1[i].begin(),vc1[i].end());
			stable_sort(vc2[i].begin(),vc2[i].end(),greater<int>());
		}
		for(int i=1;i<=m;i++){
			if(!tr[i]){
				int u=uu[i],v=vv[i];
				if(de[u]>de[v])swap(u,v);
				int v1=F[0][v],v2=jump(v,de[v]-de[u]-1);
				int qwq=get(v,v1,v2);
				if(cc[u]>1||(cc[u]==1&&son[u]!=v2)){
					ans[i]='0';continue;
				}
				if(u==1){
					if(ccc[v]==0||vc2[v].back()>1)ans[i]='1';
					else ans[i]='0';
					continue;
				}
				if(ccc[v]==0){
					if(qwq<de[u])ans[i]='1';
					else ans[i]='0';
					continue;
				}
				if(qwq<de[u]){
					if(cc[v]||mp[v][de[u]])ans[i]='0';
					else ans[i]='1';
				}
				else{if(min(u,v)==139961&&max(u,v)==139963){
					cout<<u<<' '<<v<<endl;exit(0);
				}
					if(cc[v]||mp[v][de[u]]){
						ans[i]='0';
					}
					else{
						int qwq1=0,qwq2=0;
						int l=0,r=vc1[v].size()-1;
						while(l<=r){
							int mid=l+r>>1;
							if(vc1[v][mid]<de[u])qwq1=mid+1,l=mid+1;
							else r=mid-1;
						}
						l=0,r=vc2[v].size()-1;
						while(l<=r){
							int mid=l+r>>1;
							if(vc2[v][mid]>de[u])qwq2=mid+1,l=mid+1;
							else r=mid-1;
						}
						if(qwq1+qwq2==ccc[v]){
							ans[i]='0';
						}
						else ans[i]='1';
					}
				}
			}
			else{
				int u=uu[i],v=vv[i];
				if(de[u]>de[v])swap(u,v);
				if(u==1){
					if(siz[v]==1&&c1<=2){
						ans[i]='1';continue;
					}
					if(c1>1)ans[i]='0';
					else if(ccc[v]==1)ans[i]='1';
					else ans[i]='0';
					continue;
				}
				int _cc=0;
				for(int i=head[v];i;i=e[i].nxt){
					int w=e[i].to;
					if(de[w]==de[v]+1){
						int qwq=qry(dfn[w],dfn[w]+siz[w]-1);
						if(qwq>=de[u]){
							_cc=1;break;
						}
					}
				}
				if(_cc){
					ans[i]='0';continue;
				}
				if(cc[u]==0||(cc[u]==1&&son[u]==v)){
					ans[i]='1';
				}
				else ans[i]='0';
			}
		}
		for(int i=1;i<=m;i++)
			putchar(ans[i]);
		puts("");
	}
	return 0;
}