#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
typedef unsigned long long ull;
vector<int> mod[MAXN]; vector<pair<int, int>> qvc[MAXN]; ull rd[2][MAXN], pw[MAXN]; mt19937 rnd(40094229); int n;
namespace sgt1 {
	const int N = MAXN * (19 * 4 + 4); int val[N], ls[N], rs[N], tot; ull hsh[N];
	void pushup(int rt, int l, int mid, int r) {val[rt] = val[ls[rt]] ^ val[rs[rt]]; hsh[rt] = hsh[ls[rt]] * pw[r - mid] + hsh[rs[rt]];}
	void build(int &rt, int l, int r) {
		rt = ++tot; if (l == r) return hsh[rt] = rd[val[rt] = 0][l], void(); int mid = (l + r) >> 1; build(ls[rt], l, mid); build(rs[rt], mid + 1, r); pushup(rt, l, mid, r);
	}
	void modify(int &rt, int rt2, int l, int r, int x) {
		rt = ++tot; ls[rt] = ls[rt2]; rs[rt] = rs[rt2]; if (l == r) return hsh[rt] = rd[val[rt] = !val[rt2]][l], void();
		int mid = (l + r) >> 1; x <= mid ? modify(ls[rt], ls[rt2], l, mid, x) : modify(rs[rt], rs[rt2], mid + 1, r, x); pushup(rt, l, mid, r);
	}
	int query(int rt, int rt2, int l, int r, int &s) {
		if (hsh[rt] == hsh[rt2]) return s ^= val[rt], r + 1; if (l == r) return s ^= val[rt], l; int mid = (l + r) >> 1, t; if ((t = query(ls[rt], ls[rt2], l, mid, s)) <= mid) return t; else return query(rs[rt], rs[rt2], mid + 1, r, s);
	}
}
struct node {int mx, mn;}; node operator + (const node &x, const node &y) {return {max(x.mx, y.mx), min(x.mn, y.mn)};}
int rk[MAXN];
namespace sgt2 {
	node val[MAXN << 2][2]; bool tag[MAXN << 2]; void addtag(int rt) {tag[rt] ^= 1; swap(val[rt][0], val[rt][1]);}
	void pushdown(int rt) {if (tag[rt]) addtag(rt << 1), addtag(rt << 1 | 1), tag[rt] = 0;}
	void pushup(int rt) {for (int _ = 0; _ < 2; _++) val[rt][_] = val[rt << 1][_] + val[rt << 1 | 1][_];}
	void build(int rt, int l, int r) {
		if (l == r) return val[rt][0] = {rk[l], rk[l]}, val[rt][1] = {-1, n + 1}, void(); int mid = (l + r) >> 1; build(rt << 1, l, mid); build(rt << 1 | 1, mid + 1, r); pushup(rt);
	}
	void modify(int rt, int l, int r, int x, int y) {
		if (x <= l && r <= y) return addtag(rt); pushdown(rt); int mid = (l + r) >> 1; if (x <= mid) modify(rt << 1, l, mid, x, y); if (y > mid) modify(rt << 1 | 1, mid + 1, r, x, y); pushup(rt);
	}
}
int rts[MAXN], ord[MAXN], fa[MAXN << 1], nxt[MAXN << 1], lat[MAXN << 1], siz1[MAXN << 1], siz2[MAXN << 1]; long long tot, in[MAXN << 1]; int cnt;
void erase(int x) {if (lat[x]) nxt[lat[x]] = nxt[x]; if (nxt[x]) lat[nxt[x]] = lat[x];}
void insert(int x, int y) {lat[y] = x; nxt[y] = nxt[x]; if (nxt[x]) lat[nxt[x]] = y; nxt[x] = y;}
int findfa(int a) {return fa[a] == a ? a : fa[a] = findfa(fa[a]);}
int merge(int u, int v) {if (siz1[u] + siz2[u] < siz1[v] + siz2[v]) swap(u, v); fa[v] = u; tot += siz1[u] * siz2[v] + siz2[u] * siz1[v]; cnt -= in[u] != 0; cnt -= in[v] != 0; in[u] += in[v] + siz1[u] * siz2[v] + siz2[u] * siz1[v]; siz1[u] += siz1[v]; siz2[u] += siz2[v]; cnt += in[u] != 0; erase(v); return u;}
int main() {
	int q, op; scanf("%d %d %d", &n, &q, &op);
	auto o = uniform_int_distribution<int>(1, 130); ull x = o(rnd);
	pw[0] = 1; for (int i = 1; i <= n; i++) rd[0][i] = x, rd[1][i] = x % 130 + 1, pw[i] = pw[i - 1] * 131;
	for (int i = 1; i <= q; i++) {
		int a, b, c, d; scanf("%d %d %d %d", &a, &b, &c, &d);
		mod[a].push_back(c);
		if (d < n) mod[a].push_back(d + 1);
		if (b < n) mod[b + 1].push_back(c);
		if (b < n && d < n) mod[b + 1].push_back(d + 1);
		qvc[c].push_back({a, b}); if (d < n) qvc[d + 1].push_back({a, b});
	}
	sgt1::build(rts[0], 1, n); for (int i = 1; i <= n; i++) {ord[i] = n - i + 1; rts[i] = rts[i - 1]; for (int x : mod[i]) sgt1::modify(rts[i], rts[i], 1, n, x);}
	sort(ord + 1, ord + 1 + n, [&](int x, int y) {int s = 0, t = sgt1::query(rts[x], rts[y], 1, n, s); return t == n + 1 ? 0 : s == 0;});
	for (int i = 1; i <= n; i++) rk[ord[i]] = i;
	sgt2::build(1, 1, n); for (int i = 1; i <= n << 1; i++) fa[i] = i, siz1[i] = i <= n, siz2[i] = i > n; for (int i = 1; i <= n; i++) nxt[i] = i == n ? 0 : i + 1, lat[i] = i - 1;
	for (int i = 1; i <= n; i++) {
		for (auto &x : qvc[i]) sgt2::modify(1, 1, n, x.first, x.second);
		int l = sgt2::val[1][1].mn, r = sgt2::val[1][0].mx; bool tag = r < l; l = findfa(l); r = findfa(r);
		if (tag && l != r) insert(r, i + n); else if (tag && l == r) insert(r, i + n), merge(l, i + n);
		else {while (l != r) l = merge(l, nxt[l]), r = findfa(r); insert(l, i + n); merge(l, i + n);}
		printf("%lld%c", 1ll * n * i - tot + cnt, " \n"[i == n]);
	}
}