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
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#ifdef DEBUG
#include "debug.h"
#else
#define debug(...) 42
#endif

#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, n, m) for (int i = (n); i < (m); ++i)

#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define reppr(i, n, m) for (int i = (m) - 1; i >= (n); --i)

#define each(a,x) for(auto& a : (x))
#define sz(x) int((x).size())

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;

template <typename T, typename V> void mini(T& a, V b) {if (b < a) a = b; }
template <typename T, typename V> void maxi(T& a, V b) {if (b > a) a = b; }

const char NEG = '0', UNKNOWN = '1', POS = '2';
array<array<char, 35>, 1 << 17> arr;

void solve() {
    int n, m;
    cin >> n >> m;
    vector<pi> ops(m);
    vector<int> ans(n+1);
    for (auto &[a, b] : ops) {
        cin >> a >> b;
        --a; --b;
    }

    int cnt = 1;
    rep(i, n)
        arr[0][i] = UNKNOWN;

    for (auto [a, b] : ops) {
        int newcnt = cnt;
        rep(id, cnt) {
            if (arr[id][a] == UNKNOWN && arr[id][b] == UNKNOWN) {
                arr[newcnt] = arr[id];
                arr[id][a] = arr[id][b] = NEG;
                arr[newcnt][a] = arr[newcnt][b] = POS;
                ++newcnt;
            }
            else if (arr[id][a] > arr[id][b])
                swap(arr[id][a], arr[id][b]);
        }

        cnt = newcnt;
        assert(cnt <= sz(arr));
    }

    // debug(cnt);

    rep(id, cnt) {
        int first_pos = -1, last_pos = -1;
        rep(i, n) if (arr[id][i] == POS)
            last_pos = i;
        repr(i, n) if (arr[id][i] == POS)
            first_pos = i;

        if (first_pos != -1) {
            bool skip = false;
            for (int i = first_pos; i <= last_pos; ++i) if (arr[id][i] == NEG)
                skip = true;
            if (skip)
                continue;
            for (int l = first_pos; l >= 0 && arr[id][l] != NEG; --l)
                for (int r = last_pos; r < n && arr[id][r] != NEG; ++r)
                    ans[r - l + 1] ^= 1;
        }
        else {
            int len = 0;
            rep(i, n + 1) {
                if (i != n && arr[id][i] != NEG) {
                    ++len;
                    continue;
                }
                repp(addto, 1, len + 1)
                    ans[addto] ^= len + 1 - addto;
                len = 0;
            }
        }
    }

    repp(i, 1, n + 1)
        cout << (ans[i] & 1) << ' ';
    cout << '\n';
}

int main() {
#ifdef DEBUG
    const int MEMSIZE = 1024 * 1024 * 1024;
    static_assert(MEMSIZE % 16 == 0);
    static char stack[MEMSIZE];
    asm volatile (
        "mov %[newstack], %%rsp\n"
        "call *%[funcptr]"
        :: [funcptr] "r" (solve), [newstack] "r" (stack + MEMSIZE)
    );
    exit(0);
#else
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
#endif
}