#include "bits/stdc++.h"

using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
	REP(i, v.size()) { if (i)os << " "; os << v[i]; }return os;
}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v) {
	REP(i, v.size()) { if (i)os << endl; os << v[i]; }return os;
}

const ll INF = 1LL << 60;
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

const ll V = 100000;
vector<pair<ll, ll>> G[100000];	//pair<辺の距離, 行き先の頂点>

int main() {
	ll n, m, a, b;
	bool flag;

	cin >> n >> m;

	set<ll> s1;
	vector<ll> ans(n, 0);

	REP(i, m) {
		cin >> a >> b;
		G[a].push_back(make_pair(1, b));
		G[b].push_back(make_pair(1, a));
	}

	RREP(i, n) {
		flag = true;
		REP(j, G[i].size()) {
			if (s1.count(G[i][j].second)) {
				ans[i] = 1;
				flag = false;
				break;
			}
		}
		if (flag) {
			s1.insert(i);
		}
	}

	RREP(i, n) {
		if (ans[i] == 1) {
			RREP(j, i + 1) {
				cout << ans[j];
			}
			cout << endl;
			break;
		}
	}
}