#include <bits/stdc++.h>
#define PB push_back
#define EB emplace_back
using namespace std;
const int maxn = 600000, maxm = 900000;
pair<int, int> e[maxm + 5];
int bl[maxn + 5], sz[maxn + 5];
vector<int> L[maxn + 5];
int fr[maxm + 5], to[maxm + 5];
vector<int> mv[maxm + 5];
int val[maxn + 5], s[maxn + 5];
int main() {
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= m; i++) {
		int u, v;
		scanf("%d%d", &u, &v);
		e[i] = {u + 1, v + 1};
	}
	for (int i = 1; i <= n; i++) bl[i] = i, sz[i] = 1, L[i] = {i};
	for (int i = m; i; i--) {
		int u, v; tie(u, v) = e[i];
		if (bl[u] != bl[v]) {
			u = bl[u], v = bl[v];
			if (sz[u] < sz[v]) swap(u, v);
			fr[i] = u, to[i] = v;
			mv[i] = L[v];
			for (int x : L[v]) L[u].PB(x), bl[x] = u;
			L[v].clear();
			sz[u] += sz[v];
		}
	}
	fill(s + 1, s + n + 1, 1);
	val[bl[1]] = n & 1;
	for (int i = 1; i <= m; i++) {
		bool kp = 0;
		if (fr[i]) {
			val[to[i]] = 0;
			for (int x : mv[i]) {
				val[to[i]] ^= s[x];
				bl[x] = to[i];
			}
			val[fr[i]] ^= val[to[i]];
			if (val[to[i]] != val[fr[i]] || val[fr[i]]) kp = 1;
		} else kp = 1;
		putchar('0' + kp);
		if (kp) {
			int u, v; tie(u, v) = e[i];
			s[u] ^= 1, s[v] ^= 1;
			val[bl[u]] ^= 1, val[bl[v]] ^= 1;
		}
	}
}