#include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for(int i = 0; i < (n); i++)
#define FORR(x, arr) for(auto& x:arr)
#define ITR(x, c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end())
typedef long long ll;
typedef pair<int, int> P;

int n, m;
vector<int> g[100005];
bool vis[100005], used[100005];
set<P> st;

void hoge(int cur) {
	vis[cur] = true;
	FORR(e, g[cur]) {
		if (vis[e] || st.empty()) continue;
		vis[e] = true;
		used[e] = true;
		FORR(f, g[e]) {
			st.erase({e, f});
			st.erase({f, e});
		}
	}
}

int main(int argc, char const *argv[]) {
	ios_base::sync_with_stdio(false);
	cin >> n >> m;
	FOR(i, m) {
		int u, v;
		cin >> u >> v;
		g[u].push_back(v);
		g[v].push_back(u);
		st.insert({u, v});
		st.insert({v, u});
	}
	for (int i = n-1; i >= 0; i--) {
		if (vis[i]) continue;
		hoge(i);
	}
	string ans = "";
	FOR(i, n) {
		ans += (used[i] ? "1" : "0");
	}
	reverse(ALL(ans));
	int pos = 0;
	while (ans[pos] == '0') pos++;
	cout << ans.substr(pos) << endl;
	return 0;
}