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
#include <bits/stdc++.h>
#define FOR(i, a, b) for(int i =(a); i < (b); ++i)
#define re(i, n) FOR(i, 1, n)
#define ford(i, a, b) for(int i = (a); i >= (b); --i)
#define rep(i, n) for(int i = 0;i <(n); ++i)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef vector<pll> vpll;
typedef vector<pii> vpii;

const ll inf = 1e18;
const int N = 5005;
const int mod = 1e9 + 7;

vector<pii> edges;
bool cur[40];
int cnt[40] = {0};

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    edges.resize(m);
    rep(i, m)
    {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        edges[i] = {a, b};
    }
    for (unsigned mask = 0; mask < (1u << n); ++mask)
    {
        rep(i, n) cur[i] = (mask & (1u << i));
        rep(i, m)
        {
            int a = edges[i].first;
            int b = edges[i].second;
            if (cur[a]) swap(cur[a], cur[b]);
        }
        int f = -1;
        rep(i, n)
        {
            if (cur[i])
            {
                if (f == -1) f =0;
                else if (f == 1) 
                {
                    f = 2;
                    break;
                }
            }
            else if (f == 0) f = 1;
        }
        if (f != 2)
        {
            int pcnt = __builtin_popcount(mask);
            cnt[pcnt]++;
            cnt[pcnt] &= 1;
        }
    }
    rep(i, n) cout << cnt[i+1] << ' ';
    cout << '\n';
}