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

using namespace std;

#define JOIN_(X, Y) X##Y
#define JOIN(X, Y) JOIN_(X, Y)
#define TMP JOIN(tmp, __LINE__)
#define PB push_back
#define SZ(x) int((x).size())
#define REP(i, n) for (int i = 0, TMP = (n); i < TMP; ++i)
#define FOR(i, a, b) for (int i = (a), TMP = (b); i <= TMP; ++i)
#define FORD(i, a, b) for (int i = (a), TMP = (b); i >= TMP; --i)

#ifdef DEBUG
#define DEB(x) (cerr << x)
#else
#define DEB(x)
#endif

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

const int INF = 1e9 + 9;

vector<bool> apply_transitions(const vector<bool> &t, const vector<pii> &transitions) {
    vector<bool> result(t.begin(), t.end());
    for (const auto &[a, b] : transitions) {
        if (result[a] && not result[b]) {
            swap(result[a], result[b]);
        }
    }
    return result;
}

bool is_continuous(const vector<bool> &t) {
    bool was_ready = false;
    bool is_ready = false;
    for (bool b : t) {
        if (b) {
            if (was_ready) {
                return false;
            }
            if (not is_ready) {
                is_ready = true;
            }
        } else {
            if (is_ready) {
                is_ready = false;
                was_ready = true;
            }
        }
    }
    return true;
}

void inline one() {
    int n, m;
    cin >> n >> m;
    vector<pii> transitions;
    REP(i, m) {
        int a, b;
        cin >> a >> b;
        transitions.emplace_back(a - 1, b - 1);
    }
    FOR(k, 1, n) {
        int result = 0;
        vector<bool> t(n, false);
        FOR(i, n - k, n) { t[i] = true; }
        DEB("k = " << k << ":\n");
        // for (bool b : t) {
        // DEB(b);
        // }
        DEB("\n");
        do {
            DEB("  perm: ");
            // for (bool b : t) {
            // DEB(b);
            // }
            DEB("\n");
            vector<bool> t2 = apply_transitions(t, transitions);
            if (is_continuous(t2)) {
                result = (result + 1);
                result %= 2;
            }
        } while (next_permutation(t.begin(), t.end()));
        cout << result << " ";
    }
    cout << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    // int z; cin >> z; while(z--)
    one();
}