#include<bits/stdc++.h>
#define IL inline
#define reg register
#define N 200200
#define M 10001000
#define u64 unsigned long long
#define oo (1<<30)
IL int read()
{
    reg int x=0; reg char ch=getchar();
    while(ch<'0'||ch>'9')ch=getchar();
    while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
    return x;
}

int n,m,type;
std::vector<std::pair<int,int>>row[N],col[N];
u64 pw[N];
struct Hash
{
    int x; u64 y;
    IL Hash operator +(const Hash &a)const{return {x+a.x,y*pw[a.x]+a.y};}
};

namespace Segment1
{

int rt[N],ls[M],rs[M],tot;
Hash h[M][2];
bool tag[M];

IL void turn(reg int o){tag[o]^=1,std::swap(h[o][0],h[o][1]);}
IL void pushup(reg int o){for(reg int i=2;i--;)h[o][i^tag[o]]=h[ls[o]][i]+h[rs[o]][i];}

void build(reg int &o,reg int l,reg int r)
{
    o=++tot;
    if(l==r)
    {
        h[o][0]={1,0},h[o][1]={1,1};
        return;
    }
    reg int mid=l+r>>1;
    build(ls[o],l,mid),build(rs[o],mid+1,r),pushup(o);
}

IL void clone(reg int &o)
{
    tag[++tot]=tag[o],ls[tot]=ls[o],rs[tot]=rs[o];
    for(reg int i=2;i--;)h[tot][i]=h[o][i];
    o=tot;
}

void modify(reg int &o,reg int L,reg int R,reg int l=1,reg int r=n)
{
    if(l>R||L>r)return;
    clone(o);
    if(L<=l&&r<=R)return turn(o);
    reg int mid=l+r>>1;
    modify(ls[o],L,R,l,mid),modify(rs[o],L,R,mid+1,r),pushup(o);
}

bool compare(reg int x,reg int y,reg bool wx=0,reg bool wy=0,reg int l=1,reg int r=n)
{
    if(l==r)return h[x][wx].y<h[y][wy].y;
    reg int mid=l+r>>1;
    wx^=tag[x],wy^=tag[y];
    if(h[ls[x]][wx].y==h[ls[y]][wy].y)
        return compare(rs[x],rs[y],wx,wy,mid+1,r);
    return compare(ls[x],ls[y],wx,wy,l,mid);
}

}

int fa[N],s0[N],s1[N],s2[N],cnt;
long long sum;

int find(reg int x){return fa[x]!=x?fa[x]=find(fa[x]):x;}

IL void join(reg int x,reg int y)
{
    x=find(x),y=find(y);
    cnt-=s0[x]>1,cnt-=s0[y]>1,++cnt;
    sum+=1ll*s0[x]*s1[y]+1ll*s1[x]*s0[y]+1ll*s2[y]*(s0[x]+s0[y]);
    fa[y]=x,s0[x]+=s0[y],s1[x]+=s1[y]+s2[y];
}

int p[N],ip[N];

namespace Segment2
{

#define ls (o<<1)
#define rs (o<<1|1)
#define mid (l[o]+r[o]>>1)

int l[N<<2],r[N<<2],mn[N<<2][2],mx[N<<2][2];
bool tag[N<<2];

IL void apply(reg int o)
{
    std::swap(mn[o][0],mn[o][1]);
    std::swap(mx[o][0],mx[o][1]);
    tag[o]^=1;
}

IL void pushdown(reg int o){if(tag[o])apply(ls),apply(rs),tag[o]=0;}

IL int min(reg int x,reg int y){return x<y?x:y;}
IL int max(reg int x,reg int y){return x>y?x:y;}

IL void pushup(reg int o)
{
    for(reg int i=2;i--;)
        mn[o][i]=min(mn[ls][i],mn[rs][i]),
        mx[o][i]=max(mx[ls][i],mx[rs][i]);
}

void build(reg int o,reg int L,reg int R)
{
    l[o]=L,r[o]=R;
    if(L==R)
    {
        mn[o][0]=mx[o][0]=ip[L];
        mn[o][1]=oo,mx[o][1]=-oo;
        return;
    }
    build(ls,L,mid),build(rs,mid+1,R),pushup(o);
}

void modify(reg int o,reg int L,reg int R)
{
    if(L<=l[o]&&r[o]<=R)return apply(o);
    if(L>r[o]||l[o]>R)return;
    pushdown(o),modify(ls,L,R),modify(rs,L,R),pushup(o);
}

#undef ls
#undef rs
#undef mid

}

main()
{
    n=read(),m=read(),type=read();
    for(reg int i=1,lx,rx,ly,ry;i<=m;++i)
    {
        lx=read(),rx=read(),ly=read(),ry=read();
        row[lx].push_back({ly,ry});
        row[rx+1].push_back({ly,ry});
        col[ly].push_back({lx,rx});
        col[ry+1].push_back({lx,rx});
    }
    pw[0]=1;
    for(reg int i=1;i<=n;++i)pw[i]=pw[i-1]*3;
    Segment1::build(Segment1::rt[0],1,n);
    for(reg int i=1;i<=n;++i)
    {
        Segment1::rt[i]=Segment1::rt[i-1];
        for(auto &[l,r]:row[i])
            Segment1::modify(Segment1::rt[i],l,r);
    }
    std::iota(p+1,p+1+n,1);
    std::sort(p+1,p+1+n,[&](reg int x,reg int y)
    {
        return Segment1::compare(Segment1::rt[x],Segment1::rt[y]);
    });
    for(reg int i=1;i<=n;++i)ip[p[i]]=n-i+1;
    Segment2::build(1,1,n);
    for(reg int i=1;i<=n;++i)fa[i]=i,s0[i]=1;
    for(reg int i=1,l,r,x;i<=n;++i)
    {
        for(auto &[l,r]:col[i])
            Segment2::modify(1,l,r);
        l=Segment2::mn[1][0],r=Segment2::mx[1][1];
        if(l<=r)
        {
            fprintf(stderr,"[%d, %d, %d]\n",i,l,r);
            for(x=find(l);x<r;x=find(x))join(x+1,x);
            sum+=s0[find(l)],++s1[find(l)];
        }else
        {
            l=Segment2::mx[1][1];
            fprintf(stderr,"[%d, %d]\n",i,l);
            if(l>0)
            {
                if(find(l)==l)++s2[l];
                else sum+=s0[find(l)],++s1[find(l)];
            }
        }
        fprintf(stderr,"sum = %lld, cnt = %d\n",sum,cnt);
        if(type||i==n)printf("%lld%c",1ll*n*i-sum+cnt," \n"[i==n]);
    }
}