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
#include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define REP(i, n) for(int i = 0; i < (n); ++i)

template<class T> int size(T && a) {
	return (int)(a.size());
}
ostream& operator << (ostream &os, string str) {
    for(char c : str) os << c;
    return os;
}
template <class A, class B> ostream& operator << (ostream &os, const pair<A, B> &p) {
	return os << '(' << p.first << "," << p.second << ')';
}
template <class T> auto operator << (ostream &os, T &&x) -> decltype(x.begin(), os) {
	os << '{';
	for(auto it = x.begin(); it != x.end(); ++it)
		os << *it << (it == prev(x.end()) ? "" : " ");
	return os << '}';
}
template <class T> ostream& operator << (ostream &os, vector<vector<T>> vec) {
    for(auto x : vec)
    	os << "\n  " << x;
    return os;
}
void dump() {}
template <class T, class... Args> void dump(T &&x, Args... args) {
    cerr << x << "; ";
    dump(args...);
}
#ifdef DEBUG
# define debug(x...) cerr << "[" #x "]: ", dump(x), cerr << '\n'
#else 
# define debug(...) 0
#endif

//--------------------------------------------------

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n, m;
	cin >> n >> m;

	vector<pair<int, int>> edges(m);
	REP (i, m) {
		int a, b;
		cin >> a >> b;
		--a, --b;

		edges[i] = pair(a, b);
	}

	vector<int> answer(n + 1);
	REP (mask, (1 << n)) {
		vector<int> values(n);
		REP (i, n) if (mask & (1 << i)) {
			values[i] = 1;
		}

		debug(values);
		for (auto [a, b] : edges) {
			if (values[a] == 1 and values[b] == 0)
				swap(values[a], values[b]);
		}
		debug(values);


		int blocks = 0;
		REP (i, n) {
			if (values[i] == 0) continue;

			while (i < n - 1 and values[i + 1] == 1)
				++i;

			++blocks;
		}

		debug(blocks);

		if (blocks == 1) {
			int k = __builtin_popcount(mask);
			answer[k] = (answer[k] + 1) % 2;
		}
	}

	FOR (i, 1, n) cout << answer[i] << ' ';
}