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
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
template <class T, class U> auto &operator<<(ostream &out, pair<T, U> a) { return out << "(" << a.first << ", " << a.second << ")"; }
template <class T, class = class enable_if<!is_same<T, string>(), class T::iterator>::type> auto &operator<<(ostream &out, T a) {
    out << "{";
    bool fi = 1;
    for(auto b : a) {
        if(fi) {out<<b; fi=0;}
        else out<<", "<<b;
    }
    return out << "}";
}

template <class T, class X, class Y> auto &operator<<(ostream &out, const priority_queue<T,X,Y>& a) {auto b = a; vector<T> v; while(!b.empty()) {v.push_back(b.top()); b.pop();} return out<<v; }
void dump(){
   cerr << "\e[39m"<<"\n";
}
template <class T, class... Ts> void dump(T a, Ts... x) {
   cerr << a << ", ";
   dump(x...);
}
#define debug(...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<"\t"<<"[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__)
#else
#define debug(...) ;
#endif

template<class C> C reversed(C c) {reverse(c.begin(),c.end()); return c;}
#define rep(i, n) for(int i=0;i<(int)(n);i++)
#define all(X) (X).begin(), (X).end()
#define mp make_pair
#define st first
#define nd second
typedef long long ll;
typedef pair<int,int> pii;


int32_t main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;

    vector<pair<int, int>> orders(m);
    rep(i, m) {
        cin >> orders[i].st >> orders[i].nd;
    }

    vector<int> res(n, 0);
    for (int mask = 1; mask < (1 << n); mask++) {
        int curr = mask;
        bool ok = true;

        int set_bits = __builtin_popcount(mask);

        rep(i, m) {
            if ((curr & (1 << (orders[i].st - 1))) && (curr & (1 << (orders[i].nd - 1))) == 0) {
                curr ^= (1 << (orders[i].st - 1));
                curr ^= (1 << (orders[i].nd - 1));
            }
        }

        // debug(set_bits, (bitset<4>)curr);

        bool ones = false, zeros = false;
        rep(i, n) {
            if (ones && ((curr & (1 << i)) == 0)) {
                zeros = true;
            }
            else if (curr & (1 << i)) {
                if (zeros) {
                    ok = false;
                    break;
                }

                ones = true;
            }
            // debug(i, ones, zeros, curr & (1 << i));
        }

        if (ok) {
            res[set_bits - 1] ^= 1;
            // debug("OK", set_bits);
        }
    }

    for (int x : res) cout << x << " ";
    cout << endl;

    return 0;
}