#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 << "}";
}

map<vector<int>, int> mp[1001];

vector<pair<int, int>> upd;
int dfs(vector<int>& v, int cnt, int id = 0) {
  if(mp[id].contains(v)) return mp[id][v];
    if(id == upd.size()) {
        int lt = v.size(), rt = 0;
        for(int i = 0; i < v.size(); i++) {
            if(v[i] == 1) {
                cnt++;
                if(lt == v.size()) lt = i;
                rt = i;
            }
        }
        int x = 0;
        for(int i = 0; i + cnt <= v.size() && i <= lt; i++) {
            if(i + cnt - 1 < rt) continue;
            bool f = true;
            for(int j = i; j < i + cnt; j++) {
                if(!v[j]) {
                    f = false;
                    break;
                }
            }
            if(f) x++;
        }

//        cout << dbg(id) << dbg(v) << dbg(x) << endl;

        return mp[id][v] = x & 1;
    }
    auto [a, b] = upd[id];
    if(v[a] == 0 || v[b] == 1) {
        int x = dfs(v, cnt, id + 1);
//        cout << dbg(id) << dbg(v) << dbg(x) << endl;
        return mp[id][v] = x;
    } else if(v[a] == 2 && v[b] == 2) {
        v[a] = v[b] = 0;
        int x = dfs(v, cnt, id + 1);
        if(cnt >= 2) {
            v[a] = v[b] = 1;
            x += dfs(v, cnt - 2, id + 1);
            x &= 1;
        }
        v[a] = v[b] = 2;
//        cout << dbg(id) << dbg(v) << dbg(x) << endl;
        return mp[id][v] = x;
    }
    swap(v[a], v[b]);
    int x = dfs(v, cnt, id + 1);
    swap(v[a], v[b]);

//    cout << dbg(id) << dbg(v) << dbg(x) << endl;

    return mp[id][v] = x;
}

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

    int n, m;
    cin >> n >> m;
    for(int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        upd.push_back({a, b});
    }

    for(int len = 1; len <= n; len++) {
        for(int j = 0; j <= m; j++) mp[j].clear();
        vector<int> v(n, 2);
        int x = dfs(v, len);
        if(len > 1) cout << " ";
        cout << x;
    }
    cout << endl;

    return 0;
}