#include <bits/stdc++.h>
using namespace std;
int n, a[2010], b[2010], k;
int p[2010];

bool v[2010][2010] = {0};
int c[2010];

int main() {
	freopen("dance.in", "r", stdin);
	freopen("dance.out", "w", stdout);
	cin >> n >> k;
	for (int i = 1; i <= k; i++) {
		cin >> a[i] >> b[i];
		p[a[i]] = a[i];
		p[b[i]] = b[i];
		v[a[i]][a[i]] = 1;
		v[b[i]][b[i]] = 1;
	}
	for (int i = 1; i <= n; i++)
		c[i]++;
	for (int l = 0; l <= k * k; l++) {
		int i = l % k + 1;
		swap(p[a[i]], p[b[i]]);
		if (v[a[i]][p[a[i]]] == 0) {
			v[a[i]][p[a[i]]] = 1;
			c[p[a[i]]]++;
		}
		if (v[b[i]][p[b[i]]] == 0) {
			v[b[i]][p[b[i]]] = 1;
			c[p[b[i]]]++;
		}
	}
	for (int i = 1; i <= n; i++) {
		cout << c[i] << endl;
	}
	return 0;
}