#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair <int, int> pii;


typedef vector <LL> vec;
const int N = 3e5 + 5;

const int MOD = 1065138983;
mt19937 rng(MOD - 1);


LL inv (LL x) {
	LL ret = 1;
	while (x > 1) {
		ret *= MOD - MOD / x;
		ret %= MOD;
		x = MOD % x;
	}
	return ret;
}

int n, m, d;

struct basis {
	vector <vec> a;
	basis () {}
	void add (vec v) {
		for (int i = 0; i < d; i++) if (v[i]) {
			LL w = inv(v[i]);
			for (int k = 0; k < d; k++) (v[k] *= w) %= MOD;
			if (!a[i].size()) {
				a[i] = v;
				break;
			} else {
				for (int k = 0; k < d; k++) {
					(v[k] -= a[i][k]) %= MOD;
					if (v[k] < 0) v[k] += MOD;
				}
			}
		}
	}
	int rank() {
		int cnt = 0;
		for (auto v : a) if (v.size()) cnt++;
		return cnt;
	}
};

vector <int> E[N];
basis p[N];

void work() {
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int u, v;
		cin >> u >> v;
		E[u].push_back(v);
	}
	
	d = (int) E[1].size();
	for (int i = 2; i <= n; i++) p[i].a.resize(d);
	int c = 0;
	for (auto i : E[1]) {
		vec tmp(d);
		tmp[c++] = 1;
		p[i].add (tmp);
	}
	for (int x = 2; x <= n; x++) {
		for (auto to : E[x]) {
			vec tmp(d);
			for (auto &v : p[x].a) if (v.size()) {
				int w = int(rng() % int(1e9)) + 123;
				for (int i = 0; i < d; i++) {
					(tmp[i] += w * v[i]) %= MOD;
				}
			}
			p[to].add(tmp);
		}
	}
	for (int i = 2; i <= n; i++) {
		printf("%d%c", p[i].rank(), i == n ? '\n' : ' ');
	}
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0);
	int T = 1;
	// cin >> T;
	for (int ca = 1; ca <= T; ca ++) {
		work();
	}
}