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
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;

#define FOR(i, n) for (int i = 0; i < n; i++)
#define f first
#define s second
#define pb push_back
#define all(s) s.begin(), s.end()
#define sz(s) (int)s.size()

using vi = vector<int>;
using ll = long long;
using ull = unsigned long long;
using pll = pair<ll, ll>;
using pull = pair<ull, ull>;
using vll = vector<ll>;
using ii = pair<int, int>;

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

    vector<pull> states;
    states.pb({0, 0});
    
    auto in = [](ull a, int b) -> bool { return a & (1ull << b); };

    FOR (i, m)
    {
        int a, b;
        cin >> a >> b;
        a--, b--;

        vector<pull> new_states;

        for (auto & [zap, zga] : states)
        {
            if (!in(zap | zga, a) and !in(zap | zga, b))
            {
                new_states.pb({zap | (1ull << a) | (1ull << b), zga});
                new_states.pb({zap, zga | (1ull << a) | (1ull << b)});
            }
            else if (in(zap | zga, a) and in(zap | zga, b))
            {
                if (in(zap, a) and in(zga, b))
                {
                    new_states.pb({zap ^ (1ull << a) ^ (1ull << b), zga ^ (1ull << a) ^ (1ull << b)});
                }
                else
                {
                    new_states.pb({zap, zga});
                }
            }
            else if (in(zga | zap, b))
            {
                if (in(zga, b))
                {
                    new_states.pb({zap, zga ^ (1ull << b) ^ (1ull << a)});
                }
                else
                {
                    new_states.pb({zap, zga});
                }
            }
            else
            {
                if (in(zap, a))
                {
                    new_states.pb({zap ^ (1ull << a) ^ (1ull << b), zga});
                }
                else
                {
                    new_states.pb({zap, zga});   
                }
            }
        }

        swap(states, new_states);
    }    
    
    vi ans(n + 1);

    for (auto& [zap, zga] : states)
    {
        for (int pocz = 0; pocz < n; pocz++)
        {
            ull curr_mask = 0;
            for (int kon = pocz; kon < n; kon++)
            {
                curr_mask |= (1ull << kon);
                if ((curr_mask & zap) == zap and (curr_mask & zga) == 0)
                {
                    ans[kon - pocz + 1] ^= 1;
                }
            }
        }
    }

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

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

    int tests = 1;
    // cin >> tests;

    for (int test = 1; test <= tests; test++)
    {
        solve();
    }

    return 0;
}