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
//
// Mateusz Pietrowcow
//
 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define MOD 1000000007
#define INF 1000000000
#define INFL 1000000000000000000LL
#define Tak cout << "TAK" << '\n'
#define Nie cout << "NIE" << '\n'
#define min3(x, y, z) min(x, min(y, z))
#define max3(x, y, z) max(x, max(y, z))
 
using namespace std;
 
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<long long, long long> pll;
typedef pair<unsigned long long, unsigned long long> pull;
 
bool c = 0;
bitset<35> b;
vector<ii> op;
int n, m;

void read()
{
    cin >> n >> m;

    for (int i = 0; i < m; i++)
    {
        int a, b;
        cin >> a >> b;
        op.push_back({a - 1, b - 1});
    }
    reverse(op.begin(), op.end());
}

void rSolve(int wsk)
{
    if (wsk == m) 
    {
        c ^= 1;
        return;
    }
    else if (b[op[wsk].first] != b[op[wsk].second])
    {
        if (!b[op[wsk].first] && b[op[wsk].second])
        {
            b[op[wsk].first] = 1;
            b[op[wsk].second] = 0;

            rSolve(wsk + 1);

            b[op[wsk].first] = 0;
            b[op[wsk].second] = 1;

            rSolve(wsk + 1);
        }
        else return;
    }
    else
        rSolve(wsk + 1);

}

void solve()
{
    for (int i = 1; i <= n; i++)
    {
        for (int j = 0; j < n - i + 1; j++)
        {
            b &= 0;
            b ^= (1ULL << (j + i)) - 1;
            b ^= (1ULL << j) - 1;
            rSolve(0);
        }

        cout << c << ' ';
        //cout.flush();
        c = 0;
    }
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);
 
    read();
    solve();
}