#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int M = 1e6 + 10;
int n, m, a[N], b[N];
int vis[M];
int ans[N];
int fa[N];
inline int Ask(int x) {
    return fa[x] >= 0 ? fa[x] = Ask(fa[x]) : x;
}
int main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++i) {
        scanf("%d%d", &a[i], &b[i]);
    }
    vector<int> seq;
    int loser = 1;
    memset(vis, -1, sizeof vis);
    for (int round = 0; round < 2; ++round) {
        for (int i = 1; i <= n; ++i) {
            if (vis[a[i]] == -1) { vis[a[i]] = seq.size(); seq.push_back(i << 1 | 0); } 
            else if (vis[b[i]] == -1) { vis[b[i]] = seq.size(); seq.push_back(i << 1 | 1); }
            else { loser = i; break; }
        }
        if (seq.size() != n) break;
    }
    // printf("loser: %d\n", loser);
    // for (auto x : seq) printf("%d %d\n", x >> 1, x & 1);
    // puts("");
    for (int i = 0; i < seq.size(); ++i) fa[i] = -1;
    for (int i = 0; i < (int)seq.size(); ++i) {
        int who = seq[i] >> 1, card = seq[i] & 1;
        if (card == 0) {
            if (vis[b[who]] == -1) fa[i] = -loser;
            else {
                int oth = seq[vis[b[who]]] >> 1, oth_card = seq[vis[b[who]]] & 1;
                if (oth_card == 1) {
                    // printf("Link0 %d %d\n", i, -oth);
                    fa[i] = -oth;
                } else if (vis[b[who]] < i) {
                    // printf("Link1 %d %d\n", i, -i);
                    fa[i] = -who;
                } else {
                    // printf("Link %d %d\n", i, vis[b[who]]);
                    fa[i] = vis[b[who]];
                }
            }
        }
    }
    // for (int i = 0; i < (int)seq.size(); ++i) printf("%d ", fa[i]);
    // puts("");
    for (int i = 1; i <= m; ++i) {
        if (vis[i] == -1) {
            ++ans[loser];
        } else {
            int who = seq[vis[i]] >> 1, card = seq[vis[i]] & 1;
            if (card == 1) ++ans[who];
            else {
                ++ans[-fa[Ask(vis[i])]];
            }
        }
    }
    for (int i = 1; i <= n; ++i) printf("%d\n", ans[i]);
    return 0;
}