Blockade

#include <bits/stdc++.h>
using namespace std;
 
int main() {
	int n, m;
	cin >> n >> m;
	vector<vector<int>> g(n + 1);
	for (int i = 0; i < m; i++) {
		int x, y;
		cin >> x >> y;
		g[x].push_back(y);
		g[y].push_back(x);
	}
 
	int timer = 0;
	vector<long long> ans(n + 1);
	vector<long long> sz(n + 1);
	vector<int> id(n + 1);
	vector<int> low(n + 1);
	vector<bool> seen(n + 1);
	function<void(int, int)> dfs = [&](int node, int parent) {
		sz[node] = 1;
		seen[node] = true;
		ans[node] = 1LL * 2 * (n - 1);
		id[node] = low[node] = ++timer;
		int s = 1;
		for (int son : g[node]) {
			if (son == parent) { continue; }
			if (!seen[son]) {
				dfs(son, node);
				low[node] = min(low[node], low[son]);
				sz[node] += sz[son];
				if (low[son] >= id[node]) {
					s += sz[son];
					// Add the visits going into the son's substree
					ans[node] += 1LL * 2 * sz[son] * (n - s);
				}
			} else {
				low[node] = min(low[node], id[son]);
			}
		}
	};
 
	dfs(1, 0);
 
	for (int i = 1; i <= n; i++) { cout << ans[i] << '\n'; }
}