#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"

using namespace std;
const long long int MOD = 1000000007;


long long int N, M;
int s, e;
set<int>edge[100000];
bool flag[100000] = {};
int big=0;
set<int>::iterator itr;

int main() {
	cin >> N >> M;
	for (int i = 0; i < M; i++) {
		cin >> s >> e;
		edge[s].insert(e);
		edge[e].insert(s);
	}
	for (int i = N; i >= 0; i--) {
		if (!edge[i].empty()) {
			for (auto j = edge[i].begin(); j != edge[i].end(); ++j) {
				flag[*j] = true;
				while (!edge[*j].empty()) {
					itr = edge[*j].begin();
					if(*itr!=i)	edge[*itr].erase(*j);
					edge[*j].erase(*itr);

				}
			}
			edge[i].clear();
		}
	}
	for (int i = N; i >= 0; i--) {
		if (flag[i]) {
			big = i;
			break;
		}
	}
	for (int i = big; i >= 0; i--) {
		if (flag[i])cout << "1";
		else cout << "0";
	}
	cout << endl;
	return 0;
}