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
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(1); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=1010;
int val[111][N];
int n,m,a[N],b[N],z,ret[N];
void dfs(int x,int dep) {
	if (x==m) {
		int c1=0;
		int *vl=val[dep-1];
		rep(i,0,n) if (vl[i]==1) c1++;
		rep(l,0,n) {
			int d0=0,d1=0;
			rep(r,l,n) {
				if (vl[r]==0) d0++; else if (vl[r]==1) d1++;
				if (d0) break;
				if (c1-d1==0) ret[r-l+1]^=1;
			}
		}
	} else {
		memcpy(val[dep],val[dep-1],sizeof(int)*n);
		int *vl=val[dep];
		while (x<m) {
			int u=a[x],v=b[x];
			if (vl[u]==1||vl[v]==0) {
				swap(vl[u],vl[v]);
			} else if (vl[u]==0||vl[v]==1) {
			} else {
				vl[u]=vl[v]=0;
				dfs(x+1,dep+1);
				vl[u]=vl[v]=1;
				dfs(x+1,dep+1);
				return;
			}
			++x;
		}
		if (x==m) dfs(x,dep+1);
	}
}

int main() {
	scanf("%d%d",&n,&m);
	rep(i,0,m) {
		scanf("%d%d",&a[i],&b[i]);
		--a[i]; --b[i];
	}
	rep(i,0,n) val[0][i]=-1;
	dfs(0,1);
	rep(i,1,n+1) printf("%d%c",ret[i]," \n"[i==n]);
}