1 #include <cmath>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cstdlib>
 5 #include <iostream>
 6 #include <algorithm>
 7 
 8 using namespace std;
 9 
10 #define N 5000000
11 #define LL long long
12 
13 int n, m; LL ans[N];
14 
15 int hd[N], to[N], nt[N], tot;
16 
17 int dfn[N], low[N], tim;
18 
19 int tarjan(int u, int f)
20 {   
21     dfn[u] = low[u] = ++tim; ans[u] = (n - 1) << 1;
22     
23     int cnt = 0, siz; LL sum = 0, tmp = 0;
24     
25     for (int i = hd[u]; ~i; i = nt[i])if (f != to[i])
26     {
27         if (!dfn[to[i]])
28         {
29             siz = tarjan(to[i], u);
30             low[u] = min(low[u], low[to[i]]);
31             if (low[to[i]] >= dfn[u])
32                 ans[u] += 2LL * siz * sum, sum += siz;
33             else
34                 tmp += siz;
35         }
36         else
37             low[u] = min(low[u], dfn[to[i]]);
38     }
39     
40     ans[u] += 2LL * (n - (sum + 1)) * sum;
41     
42     return sum + tmp + 1;
43 }
44 
45 signed main(void)
46 {
47     scanf("%d%d", &n, &m);
48     
49     memset(hd, -1, sizeof(hd)), tot = 0;
50     
51     for (int i = 1; i <= m; ++i)
52     {
53         int x, y; scanf("%d%d", &x, &y);
54         
55         nt[tot] = hd[x]; to[tot] = y; hd[x] = tot++;
56         nt[tot] = hd[y]; to[tot] = x; hd[y] = tot++;
57     }
58     
59     memset(dfn, 0, sizeof(dfn)); tim = 0; tarjan(1, -1);
60     
61     for (int i = 1; i <= n; ++i)
62         printf("%lld\n", ans[i]);
63 }