#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=5e3+10;
const int N=5e3;
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 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,greater<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[it->first].push(l);
		}
	}
	inline void build(){
		for(int i=1;i<=n;i++)
		{
			s.insert(pii(i,i));
		}
	}
}
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(rnk+1,rnk+1+n,1);
	sort(rnk+1,rnk+1+n,cmp);
	ODT::build();
	for(int i=1;i<=n;i++)
	{
		int l=n+1,r=0;
		for(int j=1;j<=n;j++)
		{
			if(s[rnk[j]][i]=='0'){
				l=j;
				break;
			}
		}
		for(int j=n;j;j--)
		{
			if(s[rnk[j]][i]=='1'){
				r=j;
				break;
			}
		}
		if(l<=r){
			ODT::assign(l,r);
		}
		else{
			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;
}