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

using namespace std;

#define ll long long

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;

typedef pair<int,int> ii;

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

const int MOD = 998244353;

ll read(){
    ll i;
    cin>>i;
    return i;
}

vi readvi(int n,int off=0,int shift=0){
    vi v(n+shift);
    rep(i,shift)v[i]=0;
    rep(i,n)v[i+shift]=read()+off;
    return v;
}

void YesNo(bool condition, bool do_exit=true) {
    if (condition)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
    if (do_exit)
        exit(0);
}

int main(void ) {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int n,m;

    cin >> n >> m;

    vector<ii> moves;
    vector<tuple<ll,ll,ll>> masks;

    rep(i,m) {
        int a, b;
        cin >> a >> b;
        --a;
        --b;
        moves.push_back({a,b});
        masks.push_back({1 << a,1 << b, (1 << a) | (1 << b)});
    }

    vi res(n+1, 0);

    for(int i = 1; i < (1 << n); ++i) {
        ll s = i;
        for (auto [m1, m2, m3] : masks)
            if (s & m1 and (s & m2) == 0)
                s ^= m3;
        while (s and s%2 == 0)
            s >>= 1;
        while (s and s%2 == 1)
            s >>= 1;
        if (s == 0) {
            res[__popcount(i)] ^= 1;
        }
    }

    rng(i,1,n+1)
        cout << res[i] << " ";
    cout << endl;

    //cout << accumulate(res.begin(), res.end(), 0) << endl;

    return 0;
}