// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
std::vector<int> del[100005];
int n, m, dis[100005];
long long ans[100005];
std::vector<std::pair<int, int>> g;
std::vector<int> h[100005];
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> n >> m;
    for (int i = 1, u, v; i <= m; ++i)
    {
        std::cin >> u >> v;
        del[u].push_back(v);
        del[v].push_back(u);
        g.push_back({u, v});
    }
    for (int i = 1; i <= n; ++i)
        std::sort(del[i].begin(), del[i].end());
    ans[1] = n * (n - 1ll) / 2 - m;
    for (auto i : g)
        if (int(del[i.first].size() + del[i.second].size()) < n)
            ++ans[2];
        else
            h[del[i.first].size() > del[i.second].size() ? i.first : i.second].push_back(i.first ^ i.second);
    for (int i = 1; i <= n; ++i)
        if (!h[i].empty())
        {
            std::queue<int> que;
            que.push(i);
            std::fill(dis + 1, dis + 1 + n, 0);
            std::vector<int> left;
            for (int j = 1; j <= n; ++j)
                if (i != j)
                    left.push_back(j);
            while (!que.empty())
            {
                int now = que.front();
                que.pop();
                std::vector<int> tmp(left.size());
                std::vector<int>::iterator it =
                    std::set_intersection(left.begin(), left.end(), del[now].begin(), del[now].end(), tmp.begin());
                std::set_difference(left.begin(), left.end(), del[now].begin(), del[now].end(), it);
                std::size_t len = it - tmp.begin();
                while (len < tmp.size())
                    dis[tmp.back()] = dis[now] + 1, que.push(tmp.back()), tmp.pop_back();
                left = tmp;
            }
            for (auto j : h[i])
                if (~dis[i ^ j])
                    ++ans[dis[i ^ j]];
        }
    for (int i = 1; i != n; ++i)
        std::cout << ans[i] << " \n"[i == n - 1];
    return 0;
}