#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
// 2^61 - 1 = 2'305'843'009'213'693'951
struct ModLong61 {
  static constexpr unsigned long long M = (1ULL << 61) - 1;
  unsigned long long x;
  constexpr ModLong61() : x(0ULL) {}
  constexpr ModLong61(unsigned x_) : x(x_) {}
  constexpr ModLong61(unsigned long long x_) : x(x_ % M) {}
  constexpr ModLong61(int x_) : x((x_ < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  constexpr ModLong61(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModLong61 &operator+=(const ModLong61 &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModLong61 &operator-=(const ModLong61 &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModLong61 &operator*=(const ModLong61 &a) {
    const unsigned __int128 y = static_cast<unsigned __int128>(x) * a.x;
    x = (y >> 61) + (y & M);
    x = (x >= M) ? (x - M) : x;
    return *this;
  }
  ModLong61 &operator/=(const ModLong61 &a) { return (*this *= a.inv()); }
  ModLong61 pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModLong61 a = *this, b = 1ULL; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModLong61 inv() const {
    unsigned long long a = M, b = x; long long y = 0, z = 1;
    for (; b; ) { const unsigned long long q = a / b; const unsigned long long c = a - q * b; a = b; b = c; const long long w = y - static_cast<long long>(q) * z; y = z; z = w; }
    assert(a == 1ULL); return ModLong61(y);
  }
  ModLong61 operator+() const { return *this; }
  ModLong61 operator-() const { ModLong61 a; a.x = x ? (M - x) : 0ULL; return a; }
  ModLong61 operator+(const ModLong61 &a) const { return (ModLong61(*this) += a); }
  ModLong61 operator-(const ModLong61 &a) const { return (ModLong61(*this) -= a); }
  ModLong61 operator*(const ModLong61 &a) const { return (ModLong61(*this) *= a); }
  ModLong61 operator/(const ModLong61 &a) const { return (ModLong61(*this) /= a); }
  template <class T> friend ModLong61 operator+(T a, const ModLong61 &b) { return (ModLong61(a) += b); }
  template <class T> friend ModLong61 operator-(T a, const ModLong61 &b) { return (ModLong61(a) -= b); }
  template <class T> friend ModLong61 operator*(T a, const ModLong61 &b) { return (ModLong61(a) *= b); }
  template <class T> friend ModLong61 operator/(T a, const ModLong61 &b) { return (ModLong61(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModLong61 &a) const { return (x == a.x); }
  bool operator!=(const ModLong61 &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModLong61 &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

#include <chrono>
#ifdef LOCAL
// mt19937_64 rng(58);
const ModLong61 BASE = 10;
#else
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const ModLong61 BASE = static_cast<unsigned long long>(rng());
#endif


////////////////////////////////////////////////////////////////////////////////


// 0 for null
// range 0/1 flip, range hash
namespace seg {
constexpr int MAX_NUM_NODES = 1 << 24;
int n, id, ls[MAX_NUM_NODES], rs[MAX_NUM_NODES];
vector<ModLong61> pw;
int sz[MAX_NUM_NODES], lz[MAX_NUM_NODES];
ModLong61 vals[MAX_NUM_NODES][2];
void init(int n_) {
  n = n_;
  id = 1;
  pw.resize(n + 1);
  pw[0] = 1;
  for (int i = 1; i <= n; ++i) pw[i] = pw[i - 1] * BASE;
}
int newNode() {
  assert(id < MAX_NUM_NODES);
  const int u = id++;
  ls[u] = rs[u] = 0;
  sz[u] = 0;
  lz[u] = 0;
  for (int q = 0; q < 2; ++q) vals[u][q] = 0;
  return u;
}
int copyNode(int u0) {
  const int u = newNode();
  ls[u] = ls[u0];
  rs[u] = rs[u0];
  sz[u] = sz[u0];
  lz[u] = lz[u0];
  for (int q = 0; q < 2; ++q) vals[u][q] = vals[u0][q];
  return u;
}
int leafNode() {
  const int u = newNode();
  sz[u] = 1;
  vals[u][0] = 0;
  vals[u][1] = 1;
  return u;
}
int pullNode(int uL, int uR, int f) {
  const int u = newNode();
  ls[u] = uL;
  rs[u] = uR;
  sz[u] = sz[uL] + sz[uR];
  lz[u] = f;
  for (int q = 0; q < 2; ++q) {
    vals[u][q] = vals[uL][f ^ q] + pw[sz[uL]] * vals[uR][f ^ q];
  }
  return u;
}
int build(int l, int r) {
  if (l + 1 == r) {
    return leafNode();
  }
  const int mid = (l + r) / 2;
  const int uL = build(l, mid);
  const int uR = build(mid, r);
  return pullNode(uL, uR, 0);
}
int flip(int u, int l, int r, int a, int b) {
  if (b <= l || r <= a) return u;
  if (a <= l && r <= b) {
    const int v = copyNode(u);
    lz[v] ^= 1;
    swap(vals[v][0], vals[v][1]);
    return v;
  }
  const int mid = (l + r) / 2;
  const int uL = flip(ls[u], l, mid, a, b);
  const int uR = flip(rs[u], mid, r, a, b);
  return pullNode(uL, uR, lz[u]);
}
int flip(int u, int a, int b) {
  return flip(u, 0, n, a, b);
}
int cmp(int u, int v, int fu, int fv) {
  assert(vals[u][fu] != vals[v][fv]);
  if (!ls[u]) return (vals[u][fu].x < vals[v][fv].x) ? -1 : +1;
  fu ^= lz[u];
  fv ^= lz[v];
  return (vals[ls[u]][fu] != vals[ls[v]][fv])
      ? cmp(ls[u], ls[v], fu, fv)
      : cmp(rs[u], rs[v], fu, fv);
}
int cmp(int u, int v) {
  if (vals[u][0] == vals[v][0]) return false;
  return cmp(u, v, 0, 0);
}
string toString(int u, int f = 0) {
  if (!ls[u]) return to_string(vals[u][f].x);
  f ^= lz[u];
  return toString(ls[u], f) + toString(rs[u], f);
}
}  // seg


// T: monoid representing information of an interval.
//   T()  should return the identity.
//   T(S s)  should represent a single element of the array.
//   T::push(T &l, T &r)  should push the lazy update.
//   T::pull(const T &l, const T &r)  should pull two intervals.
template <class T> struct SegmentTreeRange {
  int logN, n;
  vector<T> ts;
  SegmentTreeRange() : logN(0), n(0) {}
  explicit SegmentTreeRange(int n_) {
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
  }
  template <class S> explicit SegmentTreeRange(const vector<S> &ss) {
    const int n_ = ss.size();
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
    for (int i = 0; i < n_; ++i) at(i) = T(ss[i]);
    build();
  }
  T &at(int i) {
    return ts[n + i];
  }
  void build() {
    for (int u = n; --u; ) pull(u);
  }

  inline void push(int u) {
    ts[u].push(ts[u << 1], ts[u << 1 | 1]);
  }
  inline void pull(int u) {
    ts[u].pull(ts[u << 1], ts[u << 1 | 1]);
  }

  // Applies T::f(args...) to [a, b).
  template <class F, class... Args>
  void ch(int a, int b, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return;
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) (ts[aa++].*f)(args...);
      if (bb & 1) (ts[--bb].*f)(args...);
    }
    for (int h = 1; h <= logN; ++h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) pull(aa);
      } else {
        if ((aa << h) != a) pull(aa);
        if ((bb << h) != b) pull(bb);
      }
    }
  }

  // Calculates the product for [a, b).
  T get(int a, int b) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return T();
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    T prodL, prodR, t;
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) { t.pull(prodL, ts[aa++]); prodL = t; }
      if (bb & 1) { t.pull(ts[--bb], prodR); prodR = t; }
    }
    t.pull(prodL, prodR);
    return t;
  }

  // Calculates T::f(args...) of a monoid type for [a, b).
  //   op(-, -)  should calculate the product.
  //   e()  should return the identity.
  template <class Op, class E, class F, class... Args>
#if __cplusplus >= 201402L
  auto
#else
  decltype((std::declval<T>().*F())())
#endif
  get(int a, int b, Op op, E e, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return e();
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    auto prodL = e(), prodR = e();
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) prodL = op(prodL, (ts[aa++].*f)(args...));
      if (bb & 1) prodR = op((ts[--bb].*f)(args...), prodR);
    }
    return op(prodL, prodR);
  }

  // Find min b s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from left to right.
  //   Returns n + 1 if there is no such b.
  template <class F, class... Args>
  int findRight(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a <= n);
    if ((T().*f)(args...)) return a;
    if (a == n) return n + 1;
    a += n;
    for (int h = logN; h; --h) push(a >> h);
    for (; ; a >>= 1) if (a & 1) {
      if ((ts[a].*f)(args...)) {
        for (; a < n; ) {
          push(a);
          if (!(ts[a <<= 1].*f)(args...)) ++a;
        }
        return a - n + 1;
      }
      ++a;
      if (!(a & (a - 1))) return n + 1;
    }
  }

  // Find max a s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from right to left.
  //   Returns -1 if there is no such a.
  template <class F, class... Args>
  int findLeft(int b, F f, Args &&... args) {
    assert(0 <= b); assert(b <= n);
    if ((T().*f)(args...)) return b;
    if (b == 0) return -1;
    b += n;
    for (int h = logN; h; --h) push((b - 1) >> h);
    for (; ; b >>= 1) if ((b & 1) || b == 2) {
      if ((ts[b - 1].*f)(args...)) {
        for (; b <= n; ) {
          push(b - 1);
          if (!(ts[(b <<= 1) - 1].*f)(args...)) --b;
        }
        return b - n - 1;
      }
      --b;
      if (!(b & (b - 1))) return -1;
    }
  }
};

////////////////////////////////////////////////////////////////////////////////

constexpr int INF = 1001001001;

struct Node {
  int mn[2], mx[2];
  int lz;
  Node() : mn{+INF, +INF}, mx{-INF, -INF}, lz(0) {}
  void push(Node &l, Node &r) {
  }
  void pull(const Node &l, const Node &r) {
    for (int q = 0; q < 2; ++q) {
      mn[q] = min(l.mn[lz ^ q], r.mn[lz ^ q]);
      mx[q] = max(l.mx[lz ^ q], r.mx[lz ^ q]);
    }
  }
  void flip() {
    lz ^= 1;
    swap(mn[0], mn[1]);
    swap(mx[0], mx[1]);
  }
};


vector<int> uf;
int root(int u) {
  return (uf[u] < 0) ? u : (uf[u] = root(uf[u]));
}
bool connect(int u, int v) {
  u = root(u);
  v = root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


/*
  A[x][y] = 0: y -> x
  A[x][y] = 1: x -> y
  
  SCC contains m rows and n columns ==> (m n) cell edges
  as long as m = 0 or n = 0, we can add edges between rows or between columns
  ~~> tournament
  
  sort decr. by lex.
  - A[x] = A[x']: identify x and x'  ~~>  can assume x -> x'
  - A[x] > A[x']: \exists y s.t. A[x][y] = 1, A[x'][y] = 0  ~~>  x -> y -> x'
*/

int N, Q, O;
vector<int> X0, X1, Y0, Y1;

Int now;
vector<int> ms, ns;
vector<int> bot;
vector<int> wait;
void init() {
  now = 0;
  uf.assign(N, -1);
  ms.assign(N, 1);
  ns.assign(N, 0);
  bot.resize(N);
  for (int i = 0; i < N; ++i) bot[i] = i + 1;
  wait.assign(N + 1, 0);
}
// i-1 and i
void conn(int i) {
  int u = root(i - 1), v = root(i);
  assert(u != v);
  connect(u, v);
  if (uf[v] != u) swap(u, v);
  chmax(bot[u], bot[v]);
  now -= max((Int)ms[u] * ns[u] - 1, 0LL);
  now -= max((Int)ms[v] * ns[v] - 1, 0LL);
  ms[u] += ms[v];
  ns[u] += ns[v];
  ns[u] += wait[i];
  wait[i] = 0;
  now += max((Int)ms[u] * ns[u] - 1, 0LL);
}
void addN(int i) {
  const int u = root(i);
  now -= max((Int)ms[u] * ns[u] - 1, 0LL);
  ++ns[u];
  now += max((Int)ms[u] * ns[u] - 1, 0LL);
}

int main() {
  for (; ~scanf("%d%d%d", &N, &Q, &O); ) {
    X0.resize(Q);
    X1.resize(Q);
    Y0.resize(Q);
    Y1.resize(Q);
    for (int q = 0; q < Q; ++q) {
      scanf("%d%d%d%d", &X0[q], &X1[q], &Y0[q], &Y1[q]);
      --X0[q];
      --Y0[q];
    }
    
    vector<int> segs(N);
    seg::init(N);
    {
      vector<vector<int>> qss(N + 1);
      for (int q = 0; q < Q; ++q) {
        qss[X0[q]].push_back(q);
        qss[X1[q]].push_back(q);
      }
      int u = seg::build(0, N);
      for (int x = 0; x < N; ++x) {
        for (const int q : qss[x]) {
          u = seg::flip(u, Y0[q], Y1[q]);
        }
        segs[x] = u;
      }
    }
    vector<int> xs(N);
    for (int x = 0; x < N; ++x) xs[x] = x;
// for(const int x:xs)cerr<<"segs["<<x<<"] = "<<seg::toString(segs[x])<<endl;
    sort(xs.begin(), xs.end(), [&](int x0, int x1) -> bool {
// cerr<<"cmp "<<x0<<" "<<x1<<endl;
      return (seg::cmp(segs[x0], segs[x1]) > 0);
    });
// for(const int x:xs)cerr<<"segs["<<x<<"] = "<<seg::toString(segs[x])<<endl;
    
    vector<Int> ans(N);
    {
      vector<vector<int>> qss(N + 1);
      for (int q = 0; q < Q; ++q) {
        qss[Y0[q]].push_back(q);
        qss[Y1[q]].push_back(q);
      }
      SegmentTreeRange<Node> se(N);
      for (int i = 0; i < N; ++i) {
        se.at(xs[i]).mn[0] = i;
        se.at(xs[i]).mx[0] = i;
      }
      se.build();
      init();
      for (int y = 0; y < N; ++y) {
        for (const int q : qss[y]) {
          se.ch(X0[q], X1[q], &Node::flip);
        }
        // topmost 0, bottommost 1
        const int i0 = min(se.ts[1].mn[0], N);
        const int i1 = max(se.ts[1].mx[1], -1);
// cerr<<COLOR("33")<<"y = "<<y<<": i0 = "<<i0<<", i1 = "<<i1<<COLOR()<<endl;
        if (i0 < i1) {
          // connect y with xs[i0], ..., xs[i1]
          for (int i = i0; ; ) {
            const int b = bot[root(i)];
            if (i1 < b) break;
            conn(b);
          }
          addN(i0);
        } else {
          // 1...1 y 0...0
          if (0 < i0 && i0 < N && root(i0 - 1) == root(i0)) {
            addN(i0);
          } else {
            ++wait[i0];
          }
        }
// for(int i=0;i<N;i=bot[i]){i=root(i);cerr<<"["<<i<<","<<bot[i]<<"):"<<ms[i]<<","<<ns[i]<<" ";}cerr<<endl;
// cerr<<"wait = "<<wait<<endl;
        ans[y] = (Int)N * (y + 1) - now;
      }
    }
    
    int ou = 0;
    for (int y = O ? 0 : (N - 1); y < N; ++y) {
      if (ou++) printf(" ");
      printf("%lld", ans[y]);
    }
    puts("");
  }
  return 0;
}