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
/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pii pair<long long,long long>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
int n,m;
map <pii,int> ma;
int ans[105];
void solve()
{
	cin>>n>>m;
	vector <pii > vec;
	vec.pb(mp((1LL<<n)-1,0LL));
	while(m--)
	{
		int u,v;
		cin>>u>>v;
		u--,v--;
		if(u==v) continue;
		int tmp_siz=vec.size();
		for(int i=0;i<tmp_siz;i++)
		{
			int mask1=vec[i].fi,mask2=vec[i].se;
			if((mask1&(1LL<<u))&&(mask1&(1LL<<v)))
			{
				mask1^=(1LL<<u),mask1^=(1LL<<v);
				vec[i]=mp(mask1,mask2);
				mask2^=(1LL<<u),mask2^=(1LL<<v);
				vec.pb(mp(mask1,mask2));
				continue;
			} 
			if(mask1&(1LL<<u))
			{
				if(!(mask2&(1LL<<v))) mask1^=(1LL<<u),mask1^=(1LL<<v);
				vec[i]=mp(mask1,mask2);
				continue;
			}
			if(mask1&(1LL<<v))
			{
				if(mask2&(1LL<<u)) mask2^=(1LL<<u),mask2^=(1LL<<v),mask1^=(1LL<<u),mask1^=(1LL<<v);
				vec[i]=mp(mask1,mask2);
				continue;
			}
			if((mask2&(1LL<<u))&&!(mask2&(1LL<<v))) mask2^=(1LL<<u),mask2^=(1LL<<v);
			vec[i]=mp(mask1,mask2);
		} 
	}
	for(int i=0;i<vec.size();i++)
	{
		int mask1=vec[i].fi,mask2=vec[i].se;
		int L=inf,R=-1;
		for(int j=0;j<n;j++) if(mask2&(1LL<<j)) L=min(L,j),R=max(R,j);
		for(int l=0;l<n;l++) for(int r=l;r<n;r++)
		{
			if(!(mask1&(1LL<<r))&&!(mask2&(1LL<<r))) break;
			if(l<=L&&R<=r) ans[r-l+1]^=1;
		}
	}
	for(int i=1;i<=n;i++) cout<<ans[i]<<" ";
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
//	cin>>_;
	while(_--) solve();
	return 0;
}