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
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
#include <bits/stdc++.h>

using namespace std;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return {i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (c it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(x...) " [" #x ": " << (x) << "] "

using ll = long long;

ll Swap(ll mask, int a, int b) {
  const ll bit = ((mask >> a) ^ (mask >> b)) & 1;
  return mask ^ (bit << a) ^ (bit << b);
}

ll Set(ll mask, int a) {
  return mask | (1ll << a);
}

ll Get(ll mask, int a) {
  return (mask >> a) & 1;
}

ll Przedzial(int a, int b) {
  return ((1ll << (b - a)) - 1) << a;
}

int n, m;
vector<pair<int, int>> pary;

ll Baktracz(int p, ll zera, ll jedynki) {
  while (p < m) {
    const auto [a, b] = pary[p];
    if (Get(jedynki, a) or Get(zera, b)) {
      jedynki = Swap(jedynki, a, b);
      zera = Swap(zera, a, b);
      p++;
      continue;
    }
    if (Get(zera, a) or Get(jedynki, b)) {
      p++;
      continue;
    }
    assert(Get(zera | jedynki, a) == 0);
    assert(Get(zera | jedynki, b) == 0);
    const ll bak1 = Baktracz(p + 1, Set(Set(zera, a), b), jedynki);
    const ll bak2 = Baktracz(p + 1, zera, Set(Set(jedynki, a), b));
    return bak1 ^ bak2;
  }
  assert(p == m);
  ll wynik = 0;
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j <= n; j++) {
      const ll rang = Przedzial(i, j);
      if ((zera & rang) == 0 and (jedynki & (~rang)) == 0) {
        wynik ^= (1ll << (j - i));
      }
    }
  }
  return wynik;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);

  cin >> n >> m;
  pary.resize(m);
  for (auto& [a, b] : pary) {
    cin >> a >> b;
    a--;
    b--;
    assert(0 <= a and a < n);
    assert(0 <= b and b < n);
  }

  const ll wynik = Baktracz(0, 0ll, 0ll);

  for (int i = 1; i <= n; i++) {
    if (i > 1) cout << " ";
    cout << Get(wynik, i);
  }
  cout << "\n";
  return 0;
}