#include <bits/stdc++.h>

// #define int int64_t

const int kMaxN = 35, kMaxM = 1e3 + 5, kMaxS = (1 << 20) + 5;

int n, m;
int a[kMaxM], b[kMaxM], f[kMaxN];
bool ans[kMaxN];

void dfs(int x) {
  if (x == m + 1) {
    int tot = std::count(f + 1, f + 1 + n, 1);
    for (int i = 1; i <= n; ++i) {
      int cnt = 0;
      for (int j = i; j <= n; ++j) {
        if (f[j] == 0) break;
        if (f[j] == 1) ++cnt;
        if (cnt == tot) ans[j - i + 1] ^= 1;
      }
    }
    return;
  }
  if (f[a[x]] != -1 || f[b[x]] != -1) {
    bool fl = 0;
    if (f[a[x]] == 1 || f[b[x]] == 0) std::swap(f[a[x]], f[b[x]]), fl = 1;
    dfs(x + 1);
    if (fl) std::swap(f[a[x]], f[b[x]]);
  } else {
    f[a[x]] = f[b[x]] = 0, dfs(x + 1);
    f[a[x]] = f[b[x]] = 1, dfs(x + 1);
    f[a[x]] = f[b[x]] = -1;
  }
}

void dickdreamer() {
  std::cin >> n >> m;
  for (int i = 1; i <= m; ++i)
    std::cin >> a[i] >> b[i];
  std::fill_n(f + 1, n, -1);
  dfs(1);
  for (int i = 1; i <= n; ++i) std::cout << ans[i] << ' ';
}

int32_t main() {
#ifdef ORZXKR
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
#endif
  std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
  int T = 1;
  // std::cin >> T;
  while (T--) dickdreamer();
  // std::cerr << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
  return 0;
}