#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int n, m;
vector<pii> g[112345];
int done[112345];

int main() {
	cin >> n >> m;
	REP(i, m) {
		int a, b;
		scanf("%d %d", &a, &b);
		g[a].push_back(pii(b, i));
		g[b].push_back(pii(a, i));
	}
	
	string ans = "";
	REP(i, n) ans += '0';
	
	for (int u = n - 1; u >= 0; u--) {
		bool ok = true;
		REP(i, g[u].size()) if (!done[g[u][i].se]) { ok = false; break; }
		if (ok) continue;
		
		REP(i, g[u].size()) {
			int v = g[u][i].fi;
			
			ok = true;
			REP(j, g[v].size()) if (!done[g[v][j].se]) { ok = false; break; }
			if (ok) continue;
			
			ans[v] = '1';
			
			REP(j, g[v].size()) done[g[v][j].se] = true;
		}
	}
	
	int last = ans.size() - 1;
	while (last >= 0 && ans[last] == '0') last--;
	last++;
	
	if (last == 0) puts("0");
	else {
		ans.erase(last);
		reverse(ALL(ans));
		cout << ans << endl;
	}
	
	return 0;
}