#include<bits/stdc++.h>
#define ull unsigned long long
using namespace std;
const int N=2e5+5;
int read(){int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch==-1)f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
	return x*f;
}
void write(int x){
	if(x<10)return putchar(x^48),void();
	write(x/10),putchar((x%10)^48);
}
int n,q,ty,f[N],s[N],sz[N],sz2[N],id[N],rk[N],nxt[N],lst[N];
vector<pair<int,int> > g[N];
ull bs=131,pw[N],p1[N];
struct HSH{
	vector<pair<int,int> > g[N];	
	int rt[N],tot;
	struct node{bool tg;int ls,rs;ull sum;}tr[N*60];
	void nw(int &o,int p){o=++tot,tr[o]=tr[p];}
	void addtag(int o,int len){tr[o].sum=p1[len]-tr[o].sum,tr[o].tg^=1;}
	void downtag(int o,int l,int r,int mid){
		if(tr[o].tg)nw(tr[o].ls,tr[o].ls),nw(tr[o].rs,tr[o].rs),addtag(tr[o].ls,mid-l+1),addtag(tr[o].rs,r-mid),tr[o].tg=0; 
	}
	void update(int &o,int p,int l,int r,int x,int y){
		if(l!=r)downtag(p,l,r,(l+r)>>1);nw(o,p);
		if(x<=l&&r<=y)return addtag(o,r-l+1);
		int mid=(l+r)>>1;
		if(x<=mid)update(tr[o].ls,tr[p].ls,l,mid,x,y);
		if(y>mid)update(tr[o].rs,tr[p].rs,mid+1,r,x,y);
		tr[o].sum=tr[tr[o].ls].sum*pw[r-mid]+tr[tr[o].rs].sum;
	}
	bool query(int o,int p,int l,int r){
		if(l==r)return tr[o].sum>tr[p].sum;
		int mid=(l+r)>>1;downtag(o,l,r,mid),downtag(p,l,r,mid);
//		cout<<o<<" "<<p<<" "<<l<<" "<<r<<" "<<tr[tr[o].ls].sum<<" "<<tr[tr[p].ls].sum<<endl;
		if(tr[tr[o].ls].sum==tr[tr[p].ls].sum)return query(tr[o].rs,tr[p].rs,mid+1,r);
		return query(tr[o].ls,tr[p].ls,l,mid);
	}
	void init(){
		for(int i=1;i<=n;i++){rt[i]=rt[i-1];
			for(auto x:g[i])update(rt[i],rt[i],1,n,x.first,x.second);
		}
//		for(int i=2;i<=3;i++)
//		for(int j=2;j<=3;j++)cout<<i<<" "<<j<<" "<<endl,query(rt[i],rt[j],1,n);
	}
}T;
bool cmp(int x,int y){return T.query(T.rt[x],T.rt[y],1,n);}
struct tree{bool tg;struct node{int mx,mn;}s[2];
void addtag(){tg^=1,swap(s[0],s[1]);}
void merge(tree&x,tree&y){
	s[0].mx=max(x.s[0].mx,y.s[0].mx);
	s[1].mx=max(x.s[1].mx,y.s[1].mx);
	s[0].mn=min(x.s[0].mn,y.s[0].mn);
	s[1].mn=min(x.s[1].mn,y.s[1].mn);
}
}tr[N<<2];
void build(int o,int l,int r){
	if(l==r){
		tr[o].s[1].mx=0,tr[o].s[1].mn=N;
		tr[o].s[0].mx=tr[o].s[0].mn=rk[l];
		return ;
	}
	int mid=(l+r)>>1;
	build(o<<1,l,mid),build(o<<1|1,mid+1,r);
	tr[o].merge(tr[o<<1],tr[o<<1|1]);
//	cout<<l<<" "<<r<<" "<<tr[o].s[1].mn<<endl;
}
void downtag(int o){if(tr[o].tg)tr[o<<1].addtag(),tr[o<<1|1].addtag(),tr[o].tg=0;}
void update(int o,int l,int r,int x,int y){
	if(x<=l&&r<=y)return tr[o].addtag();
	int mid=(l+r)>>1;downtag(o);
	if(x<=mid)update(o<<1,l,mid,x,y);
	if(y>mid)update(o<<1|1,mid+1,r,x,y);
	tr[o].merge(tr[o<<1],tr[o<<1|1]); 
}
int find(int x){return x==f[x]?x:f[x]=find(f[x]);}
int d[1005][1005];
int main(){pw[0]=1,p1[0]=0;
	for(int i=1;i<N;i++)p1[i]=p1[i-1]+pw[i-1],pw[i]=pw[i-1]*bs;
//	freopen("1.in","r",stdin);
//	freopen("1.out","w",stdout);
	scanf("%d%d%d",&n,&q,&ty);
	for(int i=1;i<=n;i++)id[i]=i;
	for(int i=1,a,b,x,y;i<=q;i++){
		scanf("%d%d%d%d",&a,&b,&x,&y);
		T.g[a].push_back(make_pair(x,y));
		T.g[b+1].push_back(make_pair(x,y));
		g[x].push_back(make_pair(a,b));
		g[y+1].push_back(make_pair(a,b));
//		d[a][x]^=1,d[b+1][x]^=1,d[a][y+1]^=1,d[b+1][y+1]^=1;
	}
	/* 
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			d[i][j]^=d[i-1][j]^d[i][j-1]^d[i-1][j-1];
			cout<<d[i][j];
		}
		cout<<endl;
	} 
	for(int j=1;j<=n;j++){
		for(int i=1;i<=n;i++)if(d[i][j])cout<<i<<" "<<j+n<<endl;else cout<<j+n<<" "<<i<<endl;
		cout<<endl;
	}*/ 
	T.init(),sort(id+1,id+n+1,cmp);
	for(int i=1;i<=n;i++)rk[id[i]]=i,f[i]=i,sz[i]=1,lst[i]=i-1,nxt[i]=i+1,cout<<id[i]<<endl;
//	cout<<endl;
	build(1,1,n);
	long long ans=0;
	for(int i=1,ct=0;i<=n;i++){
		for(auto x:g[i])update(1,1,n,x.first,x.second);
		int mn=tr[1].s[0].mn,mx=tr[1].s[1].mx;
//		cout<<mn<<" "<<mx<<endl;
		if(mn<=n&&mx>0){	
			mn=find(mn),mx=find(mx);
			if(mx>=mn){
				int s1=0,s2=0;
	//			cout<<mn<<" "<<mx<<endl;
				for(int p=mn;p<=mx;p=nxt[p]){
					ans-=1ll*sz[p]*sz2[p];
					s1+=sz[p];
					s2+=sz2[p];
					ct-=sz[p]>1;
					if(p!=mn)s2+=s[p];
					f[p]=mn;
				}
				s2++,ct++;
				sz[mn]=s1,sz2[mn]=s2;
	//			cout<<sz[mn]<<" "<<sz2[mn]<<endl;
				ans+=1ll*sz[mn]*sz2[mn];
				nxt[mn]=nxt[mx];
				lst[nxt[mx]]=mn;
			}else {
				mn=find(mn),s[mn]++;
			}
		} 
//		cout<<ct<<endl;
		if(ty||i==n)printf("%lld ",1ll*n*i-ans+ct);
	}
	return 0;
}