#include <iostream>
#include <vector>
using namespace std;
const int MAXN = 200005;
const int MAXM = 200005;
struct TreeNode {
int owner;
int weight;
int medal_id;
vector<int> children;
};
TreeNode nodes[2 * MAXM];
int node_count = 0;
int active_node[MAXN];
int start_time[MAXN];
struct SegTree {
int max_val;
int id;
} tree[4 * MAXN];
void build(int node, int l, int r) {
if (l == r) {
tree[node].max_val = 0;
tree[node].id = l;
return;
}
int mid = l + (r - l) / 2;
build(2 * node, l, mid);
build(2 * node + 1, mid + 1, r);
tree[node].max_val = 0;
tree[node].id = tree[2 * node].id;
}
void update(int node, int l, int r, int idx, int val) {
if (l == r) {
tree[node].max_val += val;
return;
}
int mid = l + (r - l) / 2;
if (idx <= mid) {
update(2 * node, l, mid, idx, val);
} else {
update(2 * node + 1, mid + 1, r, idx, val);
}
if (tree[2 * node].max_val >= tree[2 * node + 1].max_val) {
tree[node].max_val = tree[2 * node].max_val;
tree[node].id = tree[2 * node].id;
} else {
tree[node].max_val = tree[2 * node + 1].max_val;
tree[node].id = tree[2 * node + 1].id;
}
}
int N, M;
vector<int> ans;
void dfs(int u) {
if (nodes[u].medal_id != -1) {
ans[tree[1].id]++;
return;
}
if (nodes[u].weight > 0) {
update(1, 0, N - 1, nodes[u].owner, nodes[u].weight);
}
for (int v : nodes[u].children) {
dfs(v);
}
if (nodes[u].weight > 0) {
update(1, 0, N - 1, nodes[u].owner, -nodes[u].weight);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
if (!(cin >> N >> M)) return 0;
for (int i = 0; i < N; i++) {
active_node[i] = -1;
start_time[i] = 0;
}
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
int new_node = node_count++;
nodes[new_node].owner = x;
nodes[new_node].weight = 0;
nodes[new_node].medal_id = -1;
if (active_node[x] != -1) {
int old_x = active_node[x];
nodes[old_x].weight = i - start_time[x];
nodes[new_node].children.push_back(old_x);
}
if (active_node[y] != -1) {
int old_y = active_node[y];
nodes[old_y].weight = i - start_time[y];
nodes[new_node].children.push_back(old_y);
active_node[y] = -1;
}
int medal_node = node_count++;
nodes[medal_node].owner = -1;
nodes[medal_node].weight = 0;
nodes[medal_node].medal_id = i;
nodes[new_node].children.push_back(medal_node);
active_node[x] = new_node;
start_time[x] = i;
}
for (int i = 0; i < N; i++) {
if (active_node[i] != -1) {
int curr = active_node[i];
nodes[curr].weight = M - start_time[i];
}
}
build(1, 0, N - 1);
ans.assign(N, 0);
for (int i = 0; i < N; i++) {
if (active_node[i] != -1) {
dfs(active_node[i]);
}
}
for (int i = 0; i < N; i++) {
cout << ans[i] << (i == N - 1 ? "" : " ");
}
cout << "\n";
return 0;
}
