#include <bits/stdc++.h>
using namespace std;
int n, m;
const int N = 100005;
vector<int> e[N];
pair<int, int> a[N * 2];
int big[N];
vector<int> v;

int dis[N];
long long ans[N];
int q[N], qh;
void bfs(const int S)
{
    set<int> s;
    for (int i = 1; i <= n; i++)
        s.insert(i);
    q[qh = 1] = S;
    s.erase(S);
    for (int i = 1; i <= n; ++i)
        dis[i] = -1;
    dis[S] = 0;
    for (int i = 1; i <= qh; i++)
    {
        int u = q[i];
        for (auto it = s.begin(); it != s.end();)
        {
            auto v = (*it);
            if (binary_search(e[u].begin(), e[u].end(), v))
            {
                it++;
                continue;
            }
            if (dis[v] == -1 || dis[v] > dis[u] + 1)
            {
                it = s.erase(it);
                dis[v] = dis[u] + 1;
                q[++qh] = v;
            }
        }
    }
    for (int i = 1; i <= n; ++i)
        if ((!big[i] || (big[i] && i > S)) && dis[i] != -1)
            ++ans[dis[i]];
}
const int M = 1000;
int flo[M][M];
const int inf = 1000005;
int main()
{
    scanf("%d%d", &n, &m);
    if (n < M)
    {
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= n; ++j)
                flo[i][j] = (i == j ? 0 : 1);
        for (int i = 1, x, y; i <= m; ++i)
        {
            scanf("%d%d", &x, &y);
            flo[x][y] = flo[y][x] = inf;
        }
        for (int k = 1; k <= n; ++k)
            for (int i = 1; i <= n; ++i)
                for (int j = 1; j <= n; ++j)
                    flo[i][j] = min(flo[i][j], flo[i][k] + flo[k][j]);
        for (int i = 1; i <= n; ++i)
            for (int j = i + 1; j <= n; ++j)
                if (flo[i][j] < inf)
                    ++ans[flo[i][j]];
        for (int i = 1; i < n; ++i)
            printf("%lld%c", ans[i], (i == n - 1 ? '\n' : ' '));
        return 0;
    }
    for (int i = 1, u, v; i <= m; ++i)
    {
        scanf("%d%d", &u, &v);
        // e[u].push_back(v);
        // e[v].push_back(u);
        e[u].push_back(v);
        e[v].push_back(u);
        a[i] = {u, v};
    }
    for (int i = 1; i <= n; i++)
        sort(e[i].begin(), e[i].end());
    int bound = n / 2 - 1;
    for (int i = 1; i <= n; ++i)
        if (e[i].size() >= bound)
        {
            big[i] = 1;
            v.push_back(i);
        }
    for (int x : v)
        bfs(x);
    ans[1] += (long long)(n - (int)v.size()) * (n - (int)v.size() - 1) / 2;
    for (int i = 1; i <= m; ++i)
        if (!big[a[i].first] && !big[a[i].second])
        {
            --ans[1];
            ++ans[2];
        }
    for (int i = 1; i < n; ++i)
        printf("%lld%c", ans[i], (i == n - 1 ? '\n' : ' '));
    return 0;
}