1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
/*
 * Opis: Główny nagłówek
 */
#include<bits/stdc++.h>
using namespace std;
using LL=long long;
#define st first
#define nd second
#define FOR(i,l,r)for(int i=(l);i<=(r);++i)
#define REP(i,n)FOR(i,0,(n)-1)
#define ssize(x)int(x.size())
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct Graph {
	int n, m;
	vector<pair<int, int> > lista;
	vector<int> type;
	vector<bool> res;

	Graph(int _n, int _m, vector<pair<int, int> > &_lista) {
		n = _n;
		m = _m;
		swap(lista, _lista);
		type.resize(n, -1);
		res.resize(n+1);
	}

	void solve() {
		array<int, 2> wh{0, 0};
		REP(i, n) {
			if (type[i] >= 0) {
				wh[type[i]]++;
			}
		}
		REP(i, n) {
			array<int, 2> curr{0, 0};
			FOR(j, i, n-1) {
				if (type[j] >= 0) {
					curr[type[j]]++;
				}
				if (curr[0] == 0 && curr[1] == wh[1]) {
					res[j-i+1] = !res[j-i+1];
				}
			}
		}
	}

	void backtrack(int k) {
		if (k == ssize(lista)) {
			solve();
			return;
		}
		int t1 = type[lista[k].st], t2 = type[lista[k].nd];
		if (t1 == -1 && t2 == -1) {
			type[lista[k].st] = type[lista[k].nd] = 0;
			backtrack(k+1);
			type[lista[k].st] = type[lista[k].nd] = 1;
			backtrack(k+1);
			type[lista[k].st] = type[lista[k].nd] = -1;
			return;
		}
		if (t1 == 1 || t2 == 0) {
			swap(type[lista[k].st], type[lista[k].nd]);
			backtrack(k+1);
			swap(type[lista[k].st], type[lista[k].nd]);
		}
		else {
			backtrack(k+1);
		}
	}
};

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int n, m;
	cin >> n >> m;
	vector<pair<int, int> > lista(m);
	for (auto &p : lista) {
		cin >> p.st >> p.nd;
		p.st--;
		p.nd--;
	}
	Graph graph(n, m, lista);
	graph.backtrack(0);
	FOR(i, 1, n) {
		cout << graph.res[i] << " ";
	}
	cout << "\n";
}