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

using namespace std;
using LL = long long;
#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define ssize(x) int(x.size())

template<class A, class B> auto &operator<<(ostream &o, pair<A, B> p) {
    return o << '(' << p.first << ", " << p.second << ')';
}

template<class T> auto operator<<(ostream &o, T x) -> decltype(x.end(), o) {
    o << '{'; int i = 0; for (auto e : x) o << (", ")+2*!i++ << e;
    return o << '}';
}

#ifdef DEBUG
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n';
#else
#define debug(...) {}
#endif


int n, m;
vector<int> a, b;
vector<int> state, ans;


void solve(int lvl) {
    if (lvl == m) {
        int lft_2 = n + 1, rgt_2 = -1;
        REP(i, n) {
            if (state[i] == 2) {
                lft_2 = min(lft_2, i);
                rgt_2 = max(rgt_2, i);
            }
        }

        if (rgt_2 == -1) {
            int prev = -1;
            REP(i, n) {
                if (state[i] == 1) {
                    prev = i;
                    continue;
                }

                FOR(j, prev + 1, i)
                    ans[j - prev] ^= 1;
            }
            return;
        }

        FOR(i, lft_2, rgt_2) {
            if (state[i] == 1)
                return;
        }

        for (int i = lft_2; i >= 0 && state[i] != 1; i--) {
            for (int j = rgt_2; j < n && state[j] != 1; j++)
                ans[j - i + 1] ^= 1;
        }

        return;
    }

    int x = a[lvl], y = b[lvl];
    if (state[x] == 0 && state[y] == 0) {
        state[x] = 1;
        state[y] = 1;
        solve(lvl + 1);
        state[x] = 2;
        state[y] = 2;
        solve(lvl + 1);
        state[x] = 0;
        state[y] = 0;
    }
    else if (
        (state[x] == 2 && state[y] == 1) ||
        (state[x] == 0 && state[y] == 1) ||
        (state[x] == 2 && state[y] == 0)) {
        swap(state[x], state[y]);
        solve(lvl + 1);
        swap(state[x], state[y]);
    }
    else {
        solve(lvl + 1);
    }
}


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

    cin >> n >> m;
    state.resize(n);
    ans.resize(n + 1);
    a.resize(m);
    b.resize(m);
    REP(i, m) {
        cin >> a[i] >> b[i];
        a[i]--;
        b[i]--;
    }

    solve(0);

    FOR(i, 1, n)
        cout << ans[i] << ' ';
    cout << '\n';

    return 0;
}