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
// Daniel Grzegorzewski
// while (clock()<=69*CLOCKS_PER_SEC)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")

#define MP make_pair
#define PB push_back
#define ST first
#define ND second

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

//X.find_by_order(k); - zwraca iterator na k-ty element (numeracja od zerowego)
//X.order_of_key(k); - zwraca liczbę elementów ostro mniejszych niż k

typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef long long LL;

void init_ios() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
}

const uint64_t SEED = chrono::steady_clock::now().time_since_epoch().count();
mt19937_64 rng(SEED);

int n, m, res[36];
VII que;

int main() {
  init_ios();
  cin >> n >> m;
  for (int i = 1; i <= m; ++i) {
    int a, b;
    cin >> a >> b;
    --a;
    --b;
    que.PB({a, b});
  }
  for (int i = 1; i < (1<<n); ++i) {
    int val = i;
    for (const auto& q: que)
      if ((val&(1<<q.ST)) && !(val&(1<<q.ND))) {
        val ^= (1<<q.ST);
        val ^= (1<<q.ND);
      }
    int all = __builtin_popcount(val);
    int fi = -1, la;
    for (int i = 0; i < n; ++i)
      if (val&(1<<i)) {
        if (fi == -1)
          fi = i;
        la = i;
      }
    if (all == la-fi+1)
      ++res[all];
  }
  for (int i = 1; i <= n; ++i) {
    if (res[i]&1)
      cout<<"1 ";
    else
      cout<<"0 ";
  }
  cout<<"\n";
}