#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/priority_queue.hpp>
using namespace std;bool Mbe;
namespace MAOJUN{

typedef long long ll;typedef pair<int,int> pi;
const int N=2e5+5;
int n,q,op,x1[N],x2[N],y1[N],y2[N];

int P[N],Q[N];
namespace T1{
	typedef unsigned long long ull;
	const int S=1.5e7;
	int idx=0,rt[N],ls[S],rs[S],cv[S];ull vl[S],H[S];
	#define md (l+r>>1)
	#define Ls ls[p],l,md
	#define Rs rs[p],md+1,r
	void U(int&p,int l,int r,int L,int R){
		int q=++idx;ls[q]=ls[p];rs[q]=rs[p];cv[q]=cv[p];H[q]=H[p];p=q;
		if(L<=l&&r<=R){H[p]=H[p]^vl[r]^vl[l-1];cv[p]^=1;return;}
		if(L<=md)U(Ls,L,R);if(R>md)U(Rs,L,R);H[p]=H[ls[p]]^H[rs[p]];
	}
	bool F(int p,int l,int r,int q,int tp,int tq){
		if(l==r)return tp>tq;tp^=cv[p];tq^=cv[q];
		return H[ls[p]]^H[ls[q]]^(tp^tq?vl[md]^vl[l-1]:0)?F(Rs,rs[q],tp,tq):F(Ls,ls[q],tp,tq);
	}
	vector<pi>vu[N];
	inline void slv(){
		for(int i=1;i<=q;i++){
			vu[x1[i]].emplace_back(y1[i],y2[i]);
			vu[x2[i]+1].emplace_back(y1[i],y2[i]);
		}
		mt19937_64 rnd(time(NULL));
		for(int i=1;i<=n;i++)vl[i]=vl[i-1]^rnd();
		for(int i=1;i<=n;i++){rt[i]=rt[i-1];for(auto[l,r]:vu[i])U(rt[i],1,n,l,r);}
		iota(P+1,P+n+1,1);sort(P+1,P+n+1,[&](int x,int y){return F(rt[x],1,n,rt[y],0,0);});
		for(int i=1;i<=n;i++)Q[P[i]]=i;
	}
}
namespace T2{
	const int S=N<<2;
	int M,L[S][2],R[S][2],tg[S];
	inline void P(int p){
		for(int o:{0,1}){L[p][o]=min(L[p<<1][o],L[p<<1|1][o]);R[p][o]=max(R[p<<1][o],R[p<<1|1][o]);}
		if(tg[p]){swap(L[p][0],L[p][1]);swap(R[p][0],R[p][1]);}
	}
	inline void C(int p){swap(L[p][0],L[p][1]);swap(R[p][0],R[p][1]);tg[p]^=1;}
	vector<pi>vu[N];
	inline void init(){
		for(M=1;M<=n;M<<=1);memset(L,0x3f,sizeof L);
		for(int i=1;i<=n;i++)L[M+i][0]=R[M+i][0]=Q[i];
		for(int i=M;i;i--)P(i);
		for(int i=1;i<=q;i++){
			vu[y1[i]].emplace_back(x1[i],x2[i]);
			vu[y2[i]+1].emplace_back(x1[i],x2[i]);
		}
	}
	inline pi qry(int i){
		for(auto[l,r]:vu[i]){
			for(l+=M-1,r+=M+1;l^r^1;){if(~l&1)C(l^1);if(r&1)C(r^1);P(l>>=1);P(r>>=1);}
			for(;l>>=1;P(l));
		}
		return pi(L[1][0],R[1][1]);
	}
}
int s1[N],s2[N],fa[N];__gnu_pbds::priority_queue<int>pq[N];
int fd(int x){return x==fa[x]?x:fa[x]=fd(fa[x]);}
inline ll f(int x){return s2[x]?(ll)s1[x]*s2[x]-1:0;}
inline void main(){
	scanf("%d%d%d",&n,&q,&op);
	for(int i=1;i<=q;i++)scanf("%d%d%d%d",&x1[i],&x2[i],&y1[i],&y2[i]);
	T1::slv();T2::init();
	for(int i=1;i<=n;i++)s1[fa[i]=i]=1;
	ll as=0;
	for(int i=1;i<=n;i++){
		auto[L,R]=T2::qry(i);
		if(L<R){
			int x=fd(R);as-=f(x);s2[x]++;
			for(int y;x>L;x=y){
				as-=f(y=fd(x-1));
				fa[x]=y;s1[y]+=s1[x];s2[y]+=s2[x];pq[y].join(pq[x]);
				while(!pq[y].empty()&&pq[y].top()>=y){s2[y]++;pq[y].pop();}
			}
			as+=f(x);
		}else if(L<=n&&R){
			int x=fd(L);
			if(x<=R){as-=f(x);s2[x]++;as+=f(x);}
			else pq[x].push(R);
		}
		if(op||i==n)printf("%lld ",(ll)i*n-as);
	}
}

}bool Med;int main(){
#ifdef LOCAL
	freopen("3.in","r",stdin);
	freopen("data.out","w",stdout);
#endif
	MAOJUN::main();
#ifdef LOCAL
	fprintf(stderr,"%lfs\n",clock()/1000.);
	fprintf(stderr,"%lfMB\n",(&Mbe-&Med)/1024./1024);
#endif
	return 0;
}