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
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
#include <bits/stdc++.h>

using namespace std;

#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define rep(i, a, b) for(int i = a; i < (b); ++i)

#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define ssize(x) int(x.size())

#define pb push_back
#define fi first
#define se second
#define ld long double

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

using LL=long long;

#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

const int MAXN = 36;

int N, M;
short good[MAXN];
unordered_map<ll, short> visited_masks[1007];

int solve_mask(vector<pii> &orders, ll mask, int cur) {
    if (cur == -1) {
        visited_masks[cur + 1][mask] = 1;
        return 1;
    }

    if (visited_masks[cur + 1].find(mask) != visited_masks[cur + 1].end()) {
        return visited_masks[cur + 1][mask];
    }

    int a = orders[cur].fi;
    int b = orders[cur].se;

    if ( ((mask >> a) & 1) && !((mask >> b) & 1)) {
        visited_masks[cur + 1][mask] = 0;
        return 0;
    }

    if ( ((mask >> b) & 1) && !((mask >> a) & 1)) {
        ll old = mask;
        ll current = mask;

        current |= (1ll << a);
        current &= (1ll << N) - 1 - (1ll << b);

        int res1 = solve_mask(orders, old, cur - 1);
        int res2 = solve_mask(orders, current, cur - 1);
        int actual = (res1 + res2) & 1;
        visited_masks[cur + 1][mask] = actual;
        
        return actual;
    }
    else {
        return solve_mask(orders, mask, cur - 1);
    }
}

void solve() {
    cin >> N >> M;

    vector<pii> orders(M);
    REP(i, M) {
        cin >> orders[i].fi >> orders[i].se;
        orders[i].fi--;
        orders[i].se--;
    }

    for (int k = 2; k < N; k++) {
        // Ile ma byc zapalonych
        ll initial = 0;

        for (int j = 0; j < k; j++) {
            initial += (1ll << j);
        }

        for (int j = 0; j <= N - k; j++) {
            // Kiedy sie zaczyna
            good[k] = (solve_mask(orders, initial, M - 1) + good[k]) & 1;

            initial -= (1ll << j);
            if (j < N - k)
                initial += (1ll << (j + k));
        }

        REP(i, M)
            visited_masks[i].clear();
    }

    good[1] = N & 1;
    good[N] = 1;

    for (int i = 1; i <= N; i++) {
        cout << (good[i] & 1) << ' ';
    }
    cout << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);

    int t = 1;
    // cin >> t;
    while(t--) {
        solve();
    }
}