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

#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

template<typename F, typename S> ostream& operator<<(ostream& os, const pair<F, S> &p) { return os<<"("<<p.first<<", "<<p.second<<")"; }
template<typename T> ostream &operator<<(ostream & os, const vector<T> &v) { os << "{"; typename vector< T > :: const_iterator it;
    for( it = v.begin(); it != v.end(); it++ ) { if( it != v.begin() ) os << ", "; os << *it; } return os << "}"; }

void dbg_out() { cerr<<'\n'; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr<<' '<<H; dbg_out(T...); }

#ifdef DEBUG
#define dbg(...) cerr<<"(" << #__VA_ARGS__ <<"):", dbg_out(__VA_ARGS__)
#else
#define dbg(...) 
#endif

int n, m;
vector<pii> swaps;
vi cnt;

void calc(int mask) {
	for(auto [a,b] : swaps)
		if(((mask>>a) & 1) && !((mask>>b) & 1)) {
			mask ^= 1<<a;
			mask ^= 1<<b;
		}
	int pref = 0, suff = 0;
	rep(i,0,n) if((mask>>i) & 1) {
		pref = i;
		break;
	}
	for(int i=n-1;i>=0;i--) if((mask>>i) & 1) {
		suff = i;
		break;
	}
	int sum = 0;
	rep(i,0,n) sum += ((mask>>i) & 1);
	dbg(mask, pref, suff, sum);
	if(sum + pref - suff == 1)
		cnt[sum]++;
}

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

	cin>>n>>m;
	rep(i,0,m) {
		int a, b;
		cin>>a>>b;
		a--; b--;
		swaps.push_back({a,b});
	}
	cnt.assign(n+1, 0);
	rep(i,0,1<<n) calc(i);
	rep(i,1,n+1) cout<<(cnt[i] % 2)<<' ';
	cout<<'\n';
}