#include<map>
#include<set>
#include<cmath>
#include<ctime>
#include<queue>
#include<stack>
#include<cstdio>
#include<vector>
#include<string>
#include<bitset>
#include<numeric>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN=2e5+10;
const int N=2e5;
const int INF=0x3f3f3f3f;
const long long LINF=0x3f3f3f3f3f3f3f3f;
int n,q,op;
string s[MAXN];
#define pii pair<int,int>
basic_string <pii> row[MAXN],col[MAXN];
int sid[MAXN],rnk[MAXN];
inline bool cmp(int x,int y){
	return s[x]>s[y];
}
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/priority_queue.hpp>
namespace ODT{
	long long res=0;
	int val[MAXN];
	__gnu_pbds::priority_queue <int,less<int>> tag[MAXN];
	set <pii> s;
	#define IT set<pii>::iterator
	inline void assign(int l,int r){
		IT itl=prev(s.lower_bound(pii(l+1,0))),itr=prev(s.lower_bound(pii(r+1,0)));
		l=itl->first;
		r=itr->second;
		int sum=1;
		for(IT it=itl;it!=next(itr);it++)
		{
			auto [tl,tr]=*it;
			if(l^tl){
				tag[l].join(tag[tl]);
			}
			res-=max((tr-tl+1ll)*val[tl]-1,0ll);
			sum+=val[tl];
		}
		s.erase(itl,next(itr));
		val[l]=sum;
		while(!tag[l].empty()&&l<=tag[l].top())
		{
			val[l]++;
			tag[l].pop();
		}
		res+=max((r-l+1ll)*val[l]-1,0ll);
		s.insert(pii(l,r));
	}
	inline void modify(int l,int r){
		IT it=prev(s.lower_bound(pii(r+1,0)));
		auto [tl,tr]=*it;
		if(tl<=l){
			res-=max((tr-tl+1ll)*val[tl]-1,0ll);
			val[tl]++;
			res+=max((tr-tl+1ll)*val[tl]-1,0ll);
		}
		else{
			tag[tl].push(l);
		}
	}
	inline void build(){
		for(int i=1;i<=n;i++)
		{
			s.insert(pii(i,i));
		}
	}
}
namespace zkw{
	int M;
	int l[MAXN<<2][2],r[MAXN<<2][2];
	bool tag[MAXN<<1];
	#define ls(x) (x<<1)
	#define rs(x) (x<<1|1)
	inline void push_up(int x){
		if(x<=M){
			l[x][0]=min(l[ls(x)][0],l[rs(x)][0]);
			l[x][1]=min(l[ls(x)][1],l[rs(x)][1]);
			r[x][0]=max(r[ls(x)][0],r[rs(x)][0]);
			r[x][1]=max(r[ls(x)][1],r[rs(x)][1]);
		}
		if(tag[x]){
			swap(l[x][0],l[x][1]);
			swap(r[x][0],r[x][1]);
		}
	}
	inline void push_tag(int x){
		swap(l[x][0],l[x][1]);
		swap(r[x][0],r[x][1]);
		tag[x]=!tag[x];
	}
	inline void build(){
		M=1<<(__lg(n)+1);
		for(int i=1;i<=n;i++)
		{
			l[i+M][0]=rnk[i];
			l[i+M][1]=INF;
			r[i+M][0]=rnk[i];
		}
		for(int i=M+n+1;i<=M+M+1;i++)
		{
			l[i][0]=INF;
			l[i][1]=INF;
		}
		for(int i=M;i;i--)
		{
			push_up(i);
		}
	}
	inline void modify(int l,int r){
		l+=M-1;
		r+=M+1;
		while(l^r^1)
		{
			if(~l&1){
				push_tag(l^1);
			}
			if(r&1){
				push_tag(r^1);
			}
			l>>=1;
			r>>=1;
			push_up(l);
			push_up(r);
		}
		while(l)
		{
			l>>=1;
			push_up(l);
		}
	}
	inline int qryl(){
		return l[1][0];
	}
	inline int qryr(){
		return r[1][1];
	}
}
inline void solve(){
	scanf("%d%d%d",&n,&q,&op);
	while(q--)
	{
		int x1,y1,x2,y2;
		scanf("%d%d%d%d",&x1,&x2,&y1,&y2);
		row[x1].push_back(pii(y1,y2));
		row[x2+1].push_back(pii(y1,y2));
		col[y1].push_back(pii(x1,x2));
		col[y2+1].push_back(pii(x1,x2));
	}
	s[0]=' '+string(n,'0');
	for(int i=1;i<=n;i++)
	{
		s[i]=s[i-1];
		for(auto [l,r]:row[i])
		{
			for_each(s[i].begin()+l,s[i].begin()+r+1,[&](char& c){c^=1;});
		}
	}
	iota(sid+1,sid+1+n,1);
	stable_sort(sid+1,sid+1+n,cmp);
	for(int i=1;i<=n;i++)
	{
		rnk[sid[i]]=i;
	}
	zkw::build();
	ODT::build();
	for(int i=1;i<=n;i++)
	{
		for(auto [l,r]:col[i])
		{
			zkw::modify(l,r);
		}
		int l=zkw::qryl(),r=zkw::qryr();
		if(l<=r){
			ODT::assign(l,r);
		}
		else if(l<=n&&r){
			ODT::modify(r,l);
		}
		if(op){
			printf("%lld ",1ll*n*i-ODT::res);
		}
	}
	if(!op){
		printf("%lld",1ll*n*n-ODT::res);
	}
	putchar('\n');
}
signed main(){
	#ifdef LOCAL
	freopen("data.in","r",stdin);
	freopen("data.out","w",stdout);
	atexit([](){fprintf(stderr,"%.3lfs\n",(double)clock()/CLOCKS_PER_SEC);});
	#endif
	solve();
	return 0;
}