#include <iostream>
#include <algorithm>
#include <queue>
#include <bitset>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 5e4 + 10, MAXM = 1e5 + 10, MAXV = 5e5 + 10;

int t, n, m, ans[MAXN];

struct Edge
{
    int op, x, u, v;
}e[MAXM];
vector <int> pt[MAXN], vid[MAXN];

vector <int> g[MAXV];
int vt;

int dfn[MAXV], low[MAXV], clk, scc[MAXV], num;
int st[MAXV], top; bool inq[MAXV];
void Tarjan(int u)
{
    dfn[u] = low[u] = ++clk, st[++top] = u, inq[u] = 1;
    for (auto v : g[u])
    {
        if (!dfn[v]) Tarjan(v), low[u] = min(low[u], low[v]);
        else if (inq[v]) low[u] = min(low[u], dfn[v]);
    }
    if (dfn[u] == low[u])
    {
        ++num;
        while (st[top] != u) scc[st[top]] = num, inq[st[top]] = 0, top--;
        scc[u] = num, inq[u] = 0, top--;
    }
}

vector <int> tr[MAXV];
int vise[MAXV];

const int MAXB = 5002, B = 5000;
bitset <MAXB> to[2][MAXV];
bitset <MAXB> res[11][MAXN], avl[11];

int main()
{
    // freopen("A.in", "r", stdin);
    // freopen("A.out", "w", stdout);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(t), Read(n), Read(m);
    for (int i = 1; i <= m; i++)
    {
        Read(e[i].op), Read(e[i].x), Read(e[i].u), Read(e[i].v);
        pt[e[i].u].push_back(e[i].x), pt[e[i].v].push_back(e[i].x + (e[i].op ^ 1));
    }
    for (int i = 1; i <= n; i++)
    {
        pt[i].push_back(t + 1);
        sort(pt[i].begin(), pt[i].end());
        int sz = unique(pt[i].begin(), pt[i].end()) - pt[i].begin();
        pt[i].resize(sz), vid[i].resize(sz);
        // cout << i << ' ' << sz << '\n';
        // for (auto x : pt[i]) cout << x << ' '; cout << '\n';
        int pre = 0;
        for (int j = 0; j < sz; j++)
        {
            vid[i][j] = ++vt, vt++;
            if (pre) g[vt - 1].push_back(pre), g[pre + 1].push_back(vt);
            pre = vt - 1;
        }
        // for (auto x : vid[i]) cout << x << ' '; cout << '\n';
    }
    for (int i = 1; i <= m; i++)
    {
        int l = lower_bound(pt[e[i].u].begin(), pt[e[i].u].end(), e[i].x) - pt[e[i].u].begin();
        int r = lower_bound(pt[e[i].v].begin(), pt[e[i].v].end(), e[i].x + (e[i].op ^ 1)) - pt[e[i].v].begin();
        l = vid[e[i].u][l], r = vid[e[i].v][r];
        // cout << l << ' ' << r << "\n";
        if (e[i].op) g[l].push_back(r + 1), g[r].push_back(l + 1);
        else g[l + 1].push_back(r + 1), g[r].push_back(l);
    }
    // for (int i = 1; i <= vt; i++)
    // {
    //     for (auto v : g[i]) cout << i << ' ' << v << "\n";
    // }
    for (int i = 1; i <= vt; i++)
        if (!dfn[i]) Tarjan(i);
    // for (int i = 1; i <= vt; i++) cout << scc[i] << ' '; cout << '\n';
    for (int i = 1; i <= vt; i++)
    {
        for (auto v : g[i])
            if (scc[i] != scc[v]) tr[scc[i]].push_back(scc[v]);
    }
    int D = (n - 1) / B + 1;
    for (int d = 1; d <= D; d++)
    {
        int l = (d - 1) * B + 1, r = min(n, d * B);
        for (int i = 1; i <= num; i++) to[0][i].reset(), to[1][i].reset();
        for (int i = l; i <= r; i++) to[0][scc[vid[i].back()]].set(i - l), to[1][scc[vid[i].back() + 1]].set(i - l);
        for (int i = 1; i <= num; i++)
        {
            for (auto v : tr[i])
                if (vise[v] != i)
                    to[0][i] |= to[0][v], to[1][i] |= to[1][v], vise[v] = i;
        }
        for (int i = 1; i <= n; i++)
        {
            if (ans[i] == -1) continue;
            int u = scc[vid[i].back()];
            if ((to[0][u] & to[1][u]).count()) ans[i] = -1;
            else ans[i] += to[0][u].count(), res[d][i] = to[1][u];
        }
    }
    int c0 = 0;
    for (int i = 1; i <= n; i++)
        if (ans[i] != -1) c0++, avl[(i - 1) / B + 1].set((i - 1) % B);
    for (int i = 1; i <= n; i++)
        if (ans[i] == -1) cout << "0 ";
        else
        {
            int c1 = 0;
            for (int d = 1; d <= D; d++) c1 += (avl[d] & res[d][i]).count();
            cout << c0 - c1 - 1 << ' ';
        }
    return 0;
}