#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>

template <typename Tp>
inline void read(Tp &x) {
    x = 0;
    bool f = true; char ch = getchar();
    for ( ; ch < '0' || ch > '9'; ch = getchar()) f ^= ch == '-';
    for ( ; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + (ch ^ 48);
    x = f ? x : -x;
}

const int N = 1e5, M = 1e6;

bool vis[M + 5];
int a[N + 5], b[N + 5], iter[M + 5], f[M + 5], ans[N + 5];
std::vector<std::pair<int, int> > Vec;

int main() {
    int n, m;
    read(n), read(m);
    for (int i = 1; i <= n; ++i) read(a[i]), read(b[i]);
    int now = 1, lose;
    while (1) {
        if (!vis[a[now]]) {
            vis[a[now]] = true;
            Vec.push_back(std::make_pair(a[now], now));
            iter[a[now]] = (int)Vec.size() - 1;
        }
        else if (!vis[b[now]]) {
            vis[b[now]] = true;
            Vec.push_back(std::make_pair(b[now], now));
            iter[b[now]] = (int)Vec.size() - 1;
        }
        else {
            lose = now;
            break;
        }
        now = now % n + 1;
    }
    ans[lose] += m - (int)Vec.size();
    // for (int i = 1; i <= m; ++i) f[i] = lose;
    for (int i = (int)Vec.size() - 1; i >= 0; --i) {
        std::pair<int, int> pii = Vec[i];
        int w = pii.first, pos = pii.second;
        if (w == b[pos]) {
            f[w] = pos;
        }
        else {
            if (!iter[b[pos]]) f[w] = lose;
            else if (iter[b[pos]] < i) f[w] = pos;
            else f[w] = f[b[pos]];
        }
        ++ans[f[w]];
    }
    for (int i = 1; i <= n; ++i) printf("%d\n", ans[i]);
    return 0;
}