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
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<ll,int> pli;
typedef pair<int,ll> pil;
typedef pair<int,int> pii;
const ll INFLL=1e18+7;
const int INF=1e9+7;
#define pb push_back
const int MAXN = 36, MAXM = 1e3+7;
int a[MAXM], b[MAXM];
bool res[MAXN];
int main()
{
	ios_base::sync_with_stdio(0);
	int n,m; cin>>n>>m;
    for(int i=1;i<=m;++i) cin>>a[i]>>b[i];
    for(int i=1;i<=m;++i){
        --a[i]; --b[i];
    }
    for(int len=1;len<=n;++len){
        for(int st=0;st<n-len+1;++st){
            ll wall = 0;
            for(int i=st;i<=st+len-1;++i) wall |= (1LL<<i);
            vector<ll> curr = {wall};
            for(int i=m;i>=1;--i){
                int x = a[i], y = b[i];
                vector<ll> tmp;
                unordered_map<ll, bool> opened;
                for(ll &mask:curr){
                    if(!((1LL<<x) & mask) && ((1LL<<y) & mask)){
                        ll _mask = mask ^ (1LL<<x) ^ (1LL<<y);
                        if(!opened.count(_mask)){
                            opened[_mask] = 1;
                            tmp.pb(_mask);
                        }
                        if(!opened[mask]){
                            opened[mask] = 1;
                            tmp.pb(mask);
                        }
                    }else if(!((1LL<<x) & mask) || ((1LL<<y) & mask)){
                        if(!opened[mask]){
                            opened[mask] = 1;
                            tmp.pb(mask);
                        }
                    }
                }
                swap(tmp, curr);
                if(curr.empty()) break;
            }
            res[len] ^= (curr.size()%2);
        }
    }
    for(int i=1;i<=n;++i) cout<<res[i]<<" ";
    cout<<"\n";
}