#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <utility>
#include <unordered_map>

using namespace std;

map<pair<int, int>, int> m;

unordered_map<int, int> active;

void dfs(vector<int>& now, vector<vector<int>>& gr, vector<int>& used, vector<int>& buf, int vir, int pred) {
    used[vir] = 0;
    now.push_back(vir);
    active[vir] = 1;
    for (auto next : gr[vir]) {
        if (next != pred || m[{vir, next}] > 1) {
            if (used[next]) {
                dfs(now, gr, used, buf, next, vir);
            } else if (active[vir]){
                buf.clear();
                vector<int> d = now;
                buf.push_back(next);
                while (d.back() != next) {
                    buf.push_back(d.back());
                    d.pop_back();
                }
            }
        }
    }
    active[vir] = 0;
    now.pop_back();
}

int main() {
    freopen("input.txt", "r", stdin);
    int n, m;
    cin >> n >> m;
    vector<vector<int>> gr(n + 1);
    vector<int> cnt(n + 1, 1);
    for (int i = 0; i < m; ++i) {
        int x, y;
        cin >> x >> y;
        m[{x, y}] = 1;
        m[{y, x}] = 1;
        gr[x].push_back(y);
        gr[y].push_back(x);
    }
    vector<int> now;
    vector<int> buf(1, 1);
    map<int, int> na;
    while (!buf.empty()) {
        buf.clear();
        vector<int> used(n + 1, 1);
        dfs(now, gr, used, buf, 1, 1);
        for (int i = 0; i < buf.size(); ++i) {
            na[buf[i]] = 1;
        }
        int main = (*na.begin()).first;
        cnt[main] = buf.size();
        for (int i = 0; i < buf.size(); ++i) {
            if (main == buf[i]) {
                continue;
            }
            cnt[buf[i]] = 0;
            for (int l = 0; l < gr[buf[i]].size(); ++l) {
                if (na[gr[buf[i]][l]] == 1) {
                    continue;
                }
                gr[main].push_back(gr[buf[i]][l]);
                gr[buf[i]].push_back(main);
                m[{main, gr[buf[i]][l]}] += m[{buf[i], gr[buf[i]][l]}];
                m[{gr[buf[i]][l], main}] += m[{gr[buf[i]][l], buf[i]}];
                m[{buf[i], gr[buf[i]][l]}] = 0;
                m[{gr[buf[i]][l], buf[i]}] = 0;

            }

            gr[buf[i]].clear();
        }
    }
    return 0;
}