#include <bits/stdc++.h>

using namespace std;

unordered_map<int, int> mp[200010];
int m, n, x, y, mx[200010], idx[200010], cnt[200010];
vector<pair<int, int>> med[200010];

int main() {
    cin >> n >> m;
    for(int i=0; i<m; i++) {
        cin >> x >> y;
        med[x].push_back({i, i});
        for(auto j: med[y]) {
            mp[j.second][y] += i-j.first;
            //cout << i << " " << x << " " << y << " " << j.first << " " << j.second << " " << mp[j.second][y] << "\n"; 
            if(mp[j.second][y] > mx[j.second]) {
                mx[j.second] = mp[j.second][y];
                idx[j.second] = y;
            } 
            med[x].push_back({i, j.second});
        }
        med[y].clear();
        if(i != m-1) continue;
        for(auto j: med[x]) {
            mp[j.second][x] += i+1-j.first;
            if(mp[j.second][x] > mx[j.second]) {
                mx[j.second] = mp[j.second][x];
                idx[j.second] = x;
            }
        }
    }
    for(int i=0; i<m; i++) {
        //cout << i << " " << mx[i] << " " << idx[i] << "--\n";
    }
    for(int i=0; i<m; i++) {
        cnt[idx[i]]++;
    }
    for(int i=0; i<n; i++) {
        cout << cnt[i] << " ";
    }
    return 0;
}