#include <bits/stdc++.h>
#define dbg(x) " [" << #x << ": " << (x) << "] "
using namespace std;
using ll = long long;
template<typename A, typename B>
ostream& operator<<(ostream& out, const pair<A,B>& p) {
    return out << "(" << p.first << ", " << p.second << ")";
}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& c) {
    out << "{";
    for(auto it = c.begin(); it != c.end(); it++) {
        if(it != c.begin()) out << ", ";
        out << *it;
    }
    return out << "}";
}

int n;
vector<int> ans;
vector<pair<int, int>> upd;
void dfs(vector<int>& v, int id = 0) {
    if(id == upd.size()) {
        int lt = n, rt = 0;
        for(int i = 0; i < n; i++) {
            if(v[i] == 1) {
                if(lt == n) lt = i;
                rt = i;
            }
        }
        for(int i = lt; i <= rt; i++) {
          if(v[i] == 0) return;
        }

        if(lt == n) {
          for(int i = 0; i < n; i++) {
            for(int j = i; j < n; j++) {
              if(v[j] == 0) break;
              ans[j - i + 1] ^= 1;
            }
          }
        } else {
          for(int i = lt; i >= 0; i--) {
            if(v[i] == 0) break;
            for(int j = rt; j < n; j++) {
              if(v[j] == 0) break;
              ans[j - i + 1] ^= 1;
            }
          }
        }
        return;
    }
    auto [a, b] = upd[id];
    if(v[a] == 0 || v[b] == 1) {
        dfs(v, id + 1);
        return;
    } else if(v[a] == 2 && v[b] == 2) {
        v[a] = v[b] = 0;
        dfs(v, id + 1);
        v[a] = v[b] = 1;
        dfs(v, id + 1);
        v[a] = v[b] = 2;
        return;
    }
    swap(v[a], v[b]);
    dfs(v, id + 1);
    swap(v[a], v[b]);
}

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

    int m;
    cin >> n >> m;
    for(int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        upd.push_back({a, b});
    }
    ans.resize(n + 1);
    vector<int> v(n, 2);
    dfs(v);

    for(int i = 1; i <= n; i++) {
      if(i > 1) cout << " ";
      cout << ans[i];
    }
    cout << endl;

    return 0;
}