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
#include <bits/stdc++.h>
using namespace std;
 
#ifdef DEBUG
auto &operator<<(auto &o, pair<auto, auto> p) {
    return o << "()" << p.first << ", " << p.second <<")";
}
auto operator<<(auto &o, auto x)-> decltype(x.end(), o) {
    o << "{";int i = 0;
    for(auto e : x) o << ", "+!i++<<e;
    return o <<"}";
}
#define debug(x...) cerr << "["#x"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(x)
#else
#define debug(...) {}
#endif

#define all(x) x.begin(), x.end()
#define pb push_back
#define fi first
#define se second
typedef pair <int, int> pii;
 
void test() {
    int n, m; cin>>n>>m;
    vector <pii> swaps(m);
    
    for (int i=0; i<m; ++i) {
        cin>>swaps[i].fi>>swaps[i].se;
    }

    int maxm = (1<<n);
    vector <int> sol(n+1);
    vector <int> res(n+1);

    for (int i=1; i<maxm; ++i) {
        int cnt=0, mn = 1e9, mx = 0;
        for (int j=0; j<n; ++j) {
            sol[j+1] = ((i & (1<<j) ? 1 : 0));
            cnt += sol[j+1];
        }
        debug(i, sol);

        for (auto &[x, y] : swaps) {
            if (sol[x] && !sol[y])
                swap(sol[x], sol[y]); 
        }
        debug(sol);

        for (int j=1; j<=n; ++j) {
            if (sol[j]) {
                mn = min(j, mn);
                mx = max(j, mx);
            }
            sol[j] = 0;
        }
        if(mx - mn + 1 == cnt) res[cnt] ^= 1;
    }
    for (int i=1; i<=n; ++i) {
        cout<<res[i]<<' ';
    }
}   
 
signed main() {
  ios_base::sync_with_stdio(0); cin.tie(0);
  int t = 1; 
//   cin>>t;
  while (t--) {
    test();
  }
}