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
#include <bits/stdc++.h>
#define fi first
#define sc second
#define pb push_back
#define rep(i,p,k) for(int i=(p);i<(k);++i)
#define forn(i,p,k) for(int i=(p);i<=(k);++i)
#define forr(i,k,p) for(int i=(k)-1;i>=(p);--i)
#define each(a,b) for(auto&a:b)
#define all(v)  begin(v), end(v)
#define RET(smth)   return void(cout<<(smth)<<'\n');
#define sz(v) (int)v.size()
using namespace std;
using pii = pair<int,int>;
using ll = long long;
using Vi = vector<int>;
#ifdef DEBUG
#include "debug.h"
#else
#define debug(...) ;
#endif

int main() {
#ifndef DEBUG
    cin.tie(0) -> sync_with_stdio(0);
#endif
    constexpr int C = 35;
    int n,m; cin >> n >> m;
    vector<pair<int,int>> Q(m);
    for(auto &[a,b] : Q) cin >> a >> b, --a, --b;
    array<bool, C> state{};
    string res(n, '0');
    rep(msk,1,(1<<n)) {
        rep(i,0,n) state[i] = (msk & (1<<i));
        for(auto [a,b] : Q) if(state[a]^state[b]) state[b]=1, state[a]=0;
        int mm,MM;
        rep(i,0,n) if(state[i]) MM = i;
        forr(i,n,0) if(state[i]) mm = i;
        int k = __builtin_popcount(msk)-1;
        if(MM-mm==k) res[k]^=1;
    }
    rep(i,0,n) cout << res[i] << ' ';
    cout << '\n';
    return 0;
}