#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <queue>
#include <utility>
#define fi first
#define se second

using namespace std;
typedef long long LL;

template <typename Tp> inline void read(Tp& x) {
    char ch; bool op = 0; x = 0;
    do ch = getchar(), op |= ch == '-'; while (ch < '0' || ch > '9');
    do x = (x<<3)+(x<<1)+(ch&15), ch = getchar(); while (ch >= '0' && ch <= '9');
    if (op) x = -x;
}

bool Mst;
const int MAXN = 1e5+5;
const int MAXM = 1e6+5;
int n, m, a[MAXN], b[MAXN];
int use[MAXM], tar[MAXN<<1], cnt[MAXN];
bool Med;

void solve() {
    for (int _ = 0; _ < 2; ++_) {
        for (int i = 1; i <= n; ++i) {
            if (!use[a[i]]) use[a[i]] = i;
            else if (!use[b[i]]) use[b[i]] = i + n;
            else return tar[0] = i, void();
        } 
    }
    tar[0] = 1;
}

int calc(int x) {
    if (tar[x]) return tar[x];
    else if (x > n) return tar[x] = x - n;
    else if (use[b[x]] && use[b[x]] < x) return tar[x] = x; 
    else return tar[x] = calc(use[b[x]]);
}

int main() {
    #ifndef ONLINE_JUDGE
    freopen("qoj4934.in", "r", stdin);
    freopen("qoj4934.out", "w", stdout);
    fprintf(stderr, "%.3lfMB\n", (&Mst - &Med) / 1048576.0);
    #endif
    read(n), read(m);
    for (int i = 1; i <= n; ++i) read(a[i]), read(b[i]);
    solve();
    for (int i = 1; i <= m; ++i) ++cnt[calc(use[i])], assert(calc(use[i]) <= n);
    for (int i = 1; i <= n; ++i) printf("%d\n", cnt[i]); 
    return 0;
}