// Skyqwq
#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N = 5e4 + 5, S = 6e5 + 5;

int T, n, m, idx = 1, ti[S], st[N], ed[N], in[S], deg[S], q[S], hh, tt;

int A[S], B[S], len;

vector<int> id[N];

map<int, int> M[N];

bool ban[S];

int ans[N], sp;

int inline get(int x, int t) {
	if (M[x].count(t)) return M[x][t];
	M[x][t] = ++idx;
	ti[idx] = t;
	id[x].pb(idx);
	++idx;
	return M[x][t];
}

vector<int> g[S], e[S];

void inline add(int x, int y) {
	g[x].pb(y), e[y].pb(x), in[x]++;
}

int inline get(int x, int t, int o) {
	return get(x, t) + o;
}

bool inline cmp1(int x, int y) {
	return ti[x] < ti[y];
}

bool vis[S], ok[S];

void dfs(int u) {
	vis[u] = 1;
	for (int v: g[u])
		if (!vis[v]) dfs(v);
}

int L, R;

typedef unsigned long long ULL;

void inline toposort() {
	hh = 1, tt = 0;
	for (int i = 2; i <= idx; i++)
		if (!in[i]) q[++tt] = i;
	while (hh <= tt) {
		int u = q[hh++];
		for (int v: e[u]) {
			A[++len] = u, B[len] = v;
			if (--in[v] == 0) q[++tt] = v;
		}
	}
}

ULL d[S];

void inline work() {
	for (int i = 2; i <= idx; i++) d[i] = 0;
	for (int i = L; i <= R; i++)
		d[ed[i]] |= 1ull << (i - L);
	for (int i = 1; i <= len; i++) {
		d[B[i]] |= d[A[i]];
	}
	
	ULL od = 0;
	for (int i = L; i <= R; i++)
		if (d[ed[i] + 1] >> (i - L) & 1) ban[i] = 1, od |= 1ull << (i - L);
	for (int i = 1; i <= n; i++) {
		ans[i] += __builtin_popcountll(d[ed[i] + 1] | od);
	}
}

int main() {
	read(T), read(n), read(m);
	while (m--) {
		int op, t, x, y; read(op), read(t), read(x), read(y);
		if (!op) {
			add(get(x, t, 0), get(y, t + 1, 0));
			add(get(y, t + 1, 1), get(x, t, 1));
		} else {
			add(get(x, t, 1), get(y, t, 0));
			add(get(y, t, 1), get(x, t, 0));
		}
	}
	for (int i = 1; i <= n; i++) {
		ed[i] = get(i, T + 1);
	}
	for (int i = 1; i <= n; i++) {
		sort(id[i].begin(), id[i].end(), cmp1);
		for (int j = 0; j + 1 < id[i].size(); j++) {
			add(id[i][j], id[i][j + 1]);
			add(id[i][j + 1] + 1, id[i][j] + 1);
		}
	}
	toposort();
	for (int u = 1; u <= n; u += 64) {
		L = u, R = min(u + 64 - 1, n);
		work();
	}
	for (int i = 1; i <= n; i++) {
		if (ban[i]) printf("0 ");
		else printf("%d ", n - 1 - ans[i]);
	}
    return 0;
}