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
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define L long long
#define MP make_pair
#define REP(i, n) for(int i = 0; i < n; ++i)
#define REPR(i, n) for(int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define FORR(i, a, b) for(int i = b - 1; i >= a; --i)
#define EB emplace_back
#define ST first
#define ND second
#define S size
#define RS resize

template<class T> using P = pair<T, T>;
template<class T> using V = vector<T>;

void run() {
    int n, m;
    cin >> n >> m;

    int a[m], b[m];
    REP(i, m) {
        cin >> a[i] >> b[i];
    }

    V<int> res(n + 1);

    bool ready[n + 1];
    FOR(mask, 1, pow(2, n) + 1) {
        fill(ready, ready + n + 1, false);
        int k = 0;
        REP(i, n) {
            if ((1 << i) & mask) {
                ready[i + 1] = true;
                k++;
            }
        }

        REP(i, m) {
            if (ready[a[i]] && !ready[b[i]]) {
                swap(ready[a[i]], ready[b[i]]);
            }
        }

        int min_ready = n + 1;
        int max_ready = -1;
        FOR(i, 1, n + 1) {
            if (ready[i]) {
                min_ready = min(min_ready, i);
                max_ready = max(max_ready, i);
            }
        }
        if (max_ready - min_ready == k - 1) {
            res[k] ^= 1;
        }
    }


    FOR(k, 1, n + 1) {
        cout << res[k] << ' ';
    }
    cout << '\n';
}

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

    run();
}