#pragma GCC optimize(3, "unroll-loops", "no-stack-protector")
#define atsum(l, r) accumulate(l, r, 0)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
template <typename T>
inline void chkmin(T &x, T y) { x = min(x, y); }
template <typename T>
inline void chkmax(T &x, T y) { x = max(x, y); }
namespace FastIO
{
// ------------------------------
#define IN_HAS_NEG
#define OUT_HAS_NEG
#define CHK_EOF
#define DISABLE_MMAP
// ------------------------------
#if __cplusplus < 201400
#error Please use C++14 or higher.
#endif
#if __cplusplus > 201700
#define INLINE_V inline
#else
#define INLINE_V
#endif
#if ( defined(LOCAL) || defined (_WIN32) ) && !defined(DISABLE_MMAP)
#define DISABLE_MMAP
#endif
#ifndef DISABLE_MMAP
#include<sys/mman.h>
#endif
#ifdef LOCAL
    inline char gc() { return getchar(); }
    inline void pc(char c) { putchar(c); }
#else
#ifdef DISABLE_MMAP
    INLINE_V constexpr int _READ_SIZE = 1 << 18;
    INLINE_V static char _read_buffer[_READ_SIZE], *_read_ptr = nullptr, *_read_ptr_end = nullptr;
    inline char gc()
    {
        if ( __builtin_expect(_read_ptr == _read_ptr_end, false) )
        {
            _read_ptr = _read_buffer;
            _read_ptr_end = _read_buffer + fread(_read_buffer, 1, _READ_SIZE, stdin);
#ifdef CHK_EOF
            if ( __builtin_expect(_read_ptr == _read_ptr_end, false) ) return EOF;
#endif
        }
        return *_read_ptr++;
    }
#else
    INLINE_V static const char *_read_ptr = (const char *)mmap(nullptr, INT_MAX, 1, 2, 0, 0);
    inline char gc() { return *_read_ptr++; }
#endif
    INLINE_V constexpr int _WRITE_SIZE = 1 << 18;
    INLINE_V static char _write_buffer[_WRITE_SIZE], *_write_ptr = _write_buffer;
    inline void pc(char c)
    {
        *_write_ptr++ = c;
        if ( __builtin_expect(_write_buffer + _WRITE_SIZE == _write_ptr, false) )
        {
            fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout);
            _write_ptr = _write_buffer;
        }
    }
    INLINE_V struct _auto_flush
    {
        ~_auto_flush() { fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout); }
    }	_auto_flush;
#endif
#ifdef CHK_EOF
    inline bool _isdigit(char c) { return ( c & 16 ) && c != EOF; }
    inline bool _isgraph(char c) { return c > 32 && c != EOF; }
#else
    inline bool _isdigit(char c) { return c & 16; }
    inline bool _isgraph(char c) { return c > 32; }
#endif
    template < class T >
    INLINE_V constexpr bool _is_integer = numeric_limits < T >::is_integer;
    template < class T >
    INLINE_V constexpr bool _is_signed = numeric_limits < T >::is_signed;
    template < class T >
    INLINE_V constexpr bool _is_unsigned = _is_integer < T > && !_is_signed < T >;
    template <> INLINE_V constexpr bool _is_integer < __int128 > = true;
    template <> INLINE_V constexpr bool _is_integer < __uint128_t > = true;
    template <> INLINE_V constexpr bool _is_signed < __int128 > = true;
    template <> INLINE_V constexpr bool _is_unsigned < __uint128_t > = true;
#undef INLINE_V
    inline void read(char &c) { do c = gc(); while ( !_isgraph(c) ); }
    inline void read_cstr(char *s)
    {
        char c = gc(); while ( !_isgraph(c) ) c = gc();
        while ( _isgraph(c) ) *s++ = c, c = gc();
        *s = 0;
    }
    inline void read(string &s)
    {
        char c = gc(); s.clear(); while ( !_isgraph(c) ) c = gc();
        while ( _isgraph(c) ) s.push_back(c), c = gc();
    }
#ifdef IN_HAS_NEG
    template < class T, enable_if_t < _is_signed < T >, int > = 0 >
    inline void read(T &x)
    {
        char c = gc(); bool f = true; x = 0;
        while ( !_isdigit(c) ) { if ( c == 45 ) f = false; c = gc(); }
        if ( f ) while ( _isdigit(c) ) x = x * 10 + ( c & 15 ), c = gc();
        else     while ( _isdigit(c) ) x = x * 10 - ( c & 15 ), c = gc();
    }
    template < class T, enable_if_t < _is_unsigned < T >, int > = 0 >
#else
    template < class T, enable_if_t < _is_integer < T >, int > = 0 >
#endif
    inline void read(T &x)
    {
        char c = gc(); while ( !_isdigit(c) ) c = gc();
        x = 0; while ( _isdigit(c) ) x = x * 10 + ( c & 15 ), c = gc();
    }
    inline void write(char c) { pc(c); }
    inline void write_cstr(const char *s) { while ( *s ) pc(*s++); }
    inline void write(const string &s) { for ( char c : s ) pc(c); }
#ifdef OUT_HAS_NEG
    template < class T, enable_if_t < _is_signed < T >, int > = 0 >
    inline void write(T x)
    {
        char buffer[numeric_limits < T >::digits10 + 1]; int digits = 0;
        if ( x >= 0 )  do buffer[digits++] =  ( x % 10 ) | 48, x /= 10; while ( x );
        else { pc(45); do buffer[digits++] = -( x % 10 ) | 48, x /= 10; while ( x ); }
        while ( digits ) pc(buffer[--digits]);
    }
    template < class T, enable_if_t < _is_unsigned < T >, int > = 0 >
#else
    template < class T, enable_if_t < _is_integer < T >, int > = 0 >
#endif
    inline void write(T x)
    {
        char buffer[numeric_limits < T >::digits10 + 1]; int digits = 0;
        do buffer[digits++] = ( x % 10 ) | 48, x /= 10; while ( x );
        while ( digits ) pc(buffer[--digits]);
    }
    template < int N > struct _tuple_io_helper
    {
        template < class ...T >
        static inline void _read(tuple < T... > &x)
        { _tuple_io_helper < N - 1 >::_read(x), read(get < N - 1 > (x)); }
        template < class ...T >
        static inline void _write(const tuple < T... > &x)
        { _tuple_io_helper < N - 1 >::_write(x), pc(32), write(get < N - 1 > (x)); }
    };
    template <> struct _tuple_io_helper < 1 >
    {
        template < class ...T >
        static inline void _read(tuple < T... > &x) { read(get < 0 > (x)); }
        template < class ...T >
        static inline void _write(const tuple < T... > &x) { write(get < 0 > (x)); }
    };
    template < class ...T >
    inline void read(tuple < T... > &x) { _tuple_io_helper < sizeof...(T) >::_read(x); }
    template < class ...T >
    inline void write(const tuple < T... > &x) { _tuple_io_helper < sizeof...(T) >::_write(x); }
    template < class T1, class T2 >
    inline void read(pair < T1, T2 > &x) { read(x.first), read(x.second); }
    template < class T1, class T2 >
    inline void write(const pair < T1, T2 > &x) { write(x.first), pc(32), write(x.second); }
    template < class T1, class ...T2 >
    inline void read(T1 &x, T2 &...y) { read(x), read(y...); }
    template < class ...T >
    inline void read_cstr(char *x, T *...y) { read_cstr(x), read_cstr(y...); }
    template < class T1, class ...T2 >
    inline void write(const T1 &x, const T2 &...y) { write(x), write(y...); }
    template < class ...T >
    inline void write_cstr(const char *x, const T *...y) { write_cstr(x), write_cstr(y...); }
    template < class T >
    inline void print(const T &x) { write(x); }
    inline void print_cstr(const char *x) { write_cstr(x); }
    template < class T1, class ...T2 >
    inline void print(const T1 &x, const T2 &...y) { print(x), pc(32), print(y...); }
    template < class ...T >
    inline void print_cstr(const char *x, const T *...y) { print_cstr(x), pc(32), print_cstr(y...); }
    inline void println() { pc(10); }
    inline void println_cstr() { pc(10); }
    template < class ...T >
    inline void println(const T &...x) { print(x...), pc(10); }
    template < class ...T >
    inline void println_cstr(const T *...x) { print_cstr(x...), pc(10); }
}
using namespace FastIO;
template <typename T>
inline void clear(T &x) {
    T y;
    swap(x, y);
}

const int N = 2e5 + 50, C = 5005;
const __int128_t P = 999999999999999989;
__int128_t h1[N], hlen[N];
bool o1;
struct Node{
    int tag, l, r;
    ll h;
} w[N * 160];
#define lc(u) w[u].l
#define rc(u) w[u].r
int cnt;
inline void pushup(int u, int len, int rlen) {
    w[u].h = (w[lc(u)].h + __int128(w[rc(u)].h) * hlen[rlen]) % P;
    if (w[u].tag) w[u].h = (h1[len] - w[u].h + P) % P;
}
inline int update(int v, int L, int R, int l, int r) {
    if (L > r || R < l) return v;
    int u = ++cnt;
    w[u] = w[v];
    if (L >= l && R <= r) {
        w[u].tag ^= 1, w[u].h = (h1[R - L + 1] - w[u].h + P) % P;
        return u;
    }
    int M = L + R >> 1;
    lc(u) = update(lc(v), L, M, l, r);
    rc(u) = update(rc(v), M + 1, R, l, r);
    pushup(u, R - L + 1, R - M);
    return u;
}
inline int query(int u, int L, int R, int x) {
    if (!u) return 0;
    if (L == R) return w[u].tag;
    int M = L + R >> 1;
    if (x <= M) return w[u].tag ^ query(lc(u), L, M, x);
    return w[u].tag ^ query(rc(u), M + 1, R, x);
}
inline __int128_t calc(__int128_t c, int len, int type) {
    if (type) return (h1[len] - c + P) % P;
    return c;
}
inline int diffpos(int u, int v, int L, int R, int tu, int tv) {
    // cerr << "find youmo:" << u << ' ' << v << ' ' << L << ' ' << R << ' ' << endl;
    // sleep(1);
    if (L == R) return L;
    tu ^= w[u].tag, tv ^= w[v].tag;
    int M = L + R >> 1;
    if (calc(w[lc(u)].h, M - L + 1, tu) == calc(w[lc(v)].h, M - L + 1, tv)) return diffpos(rc(u), rc(v), M + 1, R, tu, tv);
    return diffpos(lc(u), lc(v), L, M, tu, tv);
}

int n, q, type, a[C][C], siz[N], g[N], root[N];
int id[N], fa[N], mn[N], mx[N];
string str[N];
inline int find(int u) { return fa[u] == u ? u : (fa[u] = find(fa[u])); }
priority_queue<int> oc[N];
inline void merge(int u, int v) {
    u = find(u), v = find(v);
    if (u == v) return;
    fa[u] = v, chkmin(mn[v], mn[u]), chkmax(mx[v], mx[u]), siz[v] += siz[u];
    if (oc[v].size() < oc[u].size()) swap(oc[u], oc[v]);
    while (oc[u].size()) oc[v].push(oc[u].top()),  oc[u].pop();
    g[v] += g[u];
}
vector<pair<int, int> > upd[N];
int res[N];
bool o2;
int main() {
    cerr << (&o2 - &o1) / 1048576. << endl;
    // freopen("in", "r", stdin);
    // freopen("out", "w", stdout);
    read(n, q, type);
    // assert(type == 0);
    hlen[0] = 1;
    for (int i = 1; i <= n; i++) h1[i] = (h1[i - 1] * 5 + 1) % P, hlen[i] = hlen[i - 1] * 5 % P;
    for (int i = 1; i <= n; i++) siz[i] = 1, fa[i] = i, mn[i] = mx[i] = i;
    while (q--) {
        int x1, x2, y1, y2;
        read(x1, x2, y1, y2), ++x2, ++y2;
        upd[x1].emplace_back(y1, y2 - 1);
        upd[x2].emplace_back(y1, y2 - 1);
        a[x1][y1] ^= 1;
        a[x2][y1] ^= 1;
        a[x1][y2] ^= 1;
        a[x2][y2] ^= 1;
    }
    for (int i = 1; i <= n; i++) {
        root[i] = root[i - 1];
        for (auto [l, r] : upd[i]) root[i] = update(root[i], 1, n, l, r);
    }
    // cerr << "to there:" << endl;
    for (int i = 1; i <= n; i++) id[i] = i, str[i] = '0';
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) {
            a[i][j] = a[i][j] ^ a[i - 1][j] ^ a[i][j - 1] ^ a[i - 1][j - 1];
            if (a[i][j]) str[i] += '1';
            else str[i] += '0';
        }
    sort(id + 1, id + n + 1,[&](int x, int y) {
        if (w[root[x]].h == w[root[y]].h) return bool(0);
        int c = diffpos(root[x], root[y], 1, n, 0, 0);
        return query(root[x], 1, n, c) < query(root[y], 1 ,n, c);
    });
    // cerr << "after sort:" << endl;
    for (int i = 1; i <= n; i++) {
        int l = inf, r = 0;
        for (int j = 1; j <= n; j++)
            if (str[id[j]][i] == '1') chkmin(l, j);
            else chkmax(r, j);
        // cerr << "find youmo:" << l << ' ' << r << endl;
        if (l <= r) {
            for (int c = l; c <= r; c++) merge(l, c);
            int c = find(l);
            ++g[c];
            while (oc[c].size() && oc[c].top() >= mn[c]) ++g[c], oc[c].pop();
        } else if (l != inf) {
            if (find(l) == find(r)) ++g[find(l)];
            else 
            oc[find(l)].push(r);
        }
        int sg = 0;
        ll ans = 1ll * n * i;
        // for (int i = 1; i <= n; i++) cerr << find(i) << ' ';
        // cerr << endl;
        for (int i = 1; i <= n; i++) if (find(i) == i ) {
            ll len = 1ll * g[i] * (mx[i] - mn[i] + 1);
            // cerr << "find len:" << len << ' ' << mx[i] << ' ' << mn[i] << endl;
            sg += g[i];
            ans -= max(len, 1ll);
            ++ans;
        }
        if (type == 1 || i == n) write(ans, ' ');
    }
    return 0;
}
/*
2 2 0
1 1 1 1
2 2 2 2


1 3
2 4
3 2
4 1
*/