#include<bits/stdc++.h>

#define LL long long

#define fi first

#define se second

#define mk make_pair

#define pii pair<int,int>

#define piii pair<int, pair<int,int> >

using namespace std;

const int N = 1e5 + ;

const int M =  + ;

const int inf = 0x3f3f3f3f;

const LL INF = 0x3f3f3f3f3f3f3f3f;

const int mod = 1e9 + ;

const double eps = 1e-;

int n, m, idx, dfn[N], low[N], cnt[N];

LL ans[N];

vector<int> edge[N];

void tarjan(int u) {

    int sum = ;

    cnt[u] = ;

    dfn[u] = low[u] = ++idx;

    for(int i = ; i < edge[u].size(); i++) {

        int v = edge[u][i];

        if(dfn[v]) {

            low[u] = min(low[u], dfn[v]);

        } else {

            tarjan(v);

            cnt[u] += cnt[v];

            low[u] = min(low[u], low[v]);

            if(dfn[u] <= low[v]) {

                ans[u] += 1ll * sum * cnt[v];

                sum += cnt[v];

            }

        }

    }

    ans[u] += 1ll * sum * (n - sum - );

}

int main() {

    scanf("%d%d", &n, &m);

    for(int i = ; i <= m; i++) {

        int u, v; scanf("%d%d", &u, &v);

        edge[u].push_back(v);

        edge[v].push_back(u);

    }

    for(int i = ; i <= n; i++) {

        if(!dfn[i]) {

            tarjan(i);

        }

    }

    for(int i = ; i <= n; i++) {

        ans[i] = ans[i] + n -  << ;

        printf("%lld\n", ans[i]);

    }

    return ;

}

/*

*/