#include<bits/stdc++.h>
#include<bits/extc++.h>
#define LL long long
#define LLL __int128
#define uint unsigned
#define ldb long double
#define uLL unsigned long long
using namespace std;
const int N=2e5+5,M=N*80,Mod=998244353,INF=1e8;
int n,m,typ,rt,cnt;
LL ans;
int pw2[N];
int T[M],L[M],R[M],S[M];
vector<pair<int,int>>E[N],U[N];
int mn[N*4][2],mx[N*4][2],tg[N*4];
__gnu_pbds::priority_queue<int>Q[N];
int RT[N],id[N],pos[N],fd[N],g[N],sz[N];
inline int find(const int&x){
    return x==fd[x]?x:fd[x]=find(fd[x]);
}
inline void flip(int&p,int l,int r,int x,int y){
    const int q=p;
    p=++cnt,L[p]=L[q],R[p]=R[q],S[p]=S[q],T[p]=T[q];
    if(x<=l&&r<=y){
        T[p]=(pw2[r-l+1]-1-T[p]+Mod)%Mod,S[p]^=1;
        return;
    }
    const int mid=(l+r)>>1;
    if(x<=mid)flip(L[p],l,mid,x,y);
    if(mid<y)flip(R[p],mid+1,r,x,y);
    T[p]=(1ll*T[L[p]]*pw2[r-mid]+T[R[p]])%Mod;
    if(S[p])T[p]=(pw2[r-l+1]-1-T[p]+Mod)%Mod;
}
inline int cmp(int p,int q,int l,int r,int ps=0,int qs=0){
    if((ps^qs)?((T[p]+T[q]-pw2[r-l+1]+1)%Mod==0):(T[p]==T[q]))return 0;
    if(l==r)return (ps?1-T[p]:T[p])<(qs?1-T[q]:T[q]);
    const int mid=(l+r)>>1;
    ps^=S[p],qs^=S[q];
    if((ps^qs)?((T[L[p]]+T[L[q]]-pw2[r-l+1]+1)%Mod==0):(T[L[p]]==T[L[q]]))return cmp(R[p],R[q],mid+1,r,ps,qs);
    return cmp(L[p],L[q],l,mid,ps,qs);
}
inline void rev(int p){
    swap(mn[p][0],mn[p][1]),swap(mx[p][0],mx[p][1]),tg[p]^=1;
}
inline void pushup(int p){
    const int ls=p*2,rs=p*2+1;
    mn[p][0]=min(mn[ls][0],mn[rs][0]);
    mn[p][1]=min(mn[ls][1],mn[rs][1]);
    mx[p][0]=max(mx[ls][0],mx[rs][0]);
    mx[p][1]=max(mx[ls][1],mx[rs][1]);
}
inline void build(int p,int l,int r){
    if(l==r){
        mn[p][0]=pos[l],mx[p][0]=pos[l];
        mn[p][1]=INF,mx[p][1]=-INF;
        return;
    }
    const int mid=(l+r)>>1,ls=p*2,rs=p*2+1;
    build(ls,l,mid),build(rs,mid+1,r);
    pushup(p);
}
inline void flipn(int p,int l,int r,int x,int y){
    if(x<=l&&r<=y)return rev(p);
    const int mid=(l+r)>>1,ls=p*2,rs=p*2+1;
    if(tg[p])rev(ls),rev(rs),tg[p]=0;
    if(x<=mid)flipn(ls,l,mid,x,y);
    if(mid<y)flipn(rs,mid+1,r,x,y);
    pushup(p);
}
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    cin>>n>>m>>typ,pw2[0]=1;
    for(int i=1;i<=n;++i)pw2[i]=pw2[i-1]*2%Mod;
    for(int i=1;i<=m;++i){
        int l,r,d,u;cin>>l>>r>>d>>u;
        E[l].emplace_back(d,u);
        E[r+1].emplace_back(d,u);
        U[d].emplace_back(l,r);
        U[u+1].emplace_back(l,r);
    }
    for(int i=1;i<=n;++i){
        for(auto [l,r]:E[i])flip(rt,1,n,l,r);
        RT[i]=rt,id[i]=i;
    }
    stable_sort(id+1,id+n+1,[&](const int&x,const int&y){
        return cmp(RT[x],RT[y],1,n);
    });
    for(int i=1;i<=n;++i)pos[id[i]]=i;
    iota(fd+1,fd+n+1,1),fill(sz+1,sz+n+1,1);
    build(1,1,n);
    for(int i=1;i<=n;++i){
        ans+=n;
        for(auto [l,r]:U[i])flipn(1,1,n,l,r);
        int l=mn[1][1],r=mx[1][0];
        if(l<=r){
            int x=find(r);
            ans+=max(1ll*sz[x]*g[x]-1,0ll);
            ++g[x];
            ans-=max(1ll*sz[x]*g[x]-1,0ll);
            while(x>l){
                int y=find(x-1);
                ans+=max(1ll*sz[x]*g[x]-1,0ll)+max(1ll*sz[y]*g[y]-1,0ll);
                fd[x]=y,sz[y]+=sz[x],g[y]+=g[x];
                Q[y].join(Q[x]);
                while(!Q[y].empty()&&Q[y].top()>=y)Q[y].pop(),++g[y];
                ans-=max(1ll*sz[y]*g[y]-1,0ll),x=y;
            }
        }
        else if(l<=n&&r>=1){
            int x=find(l);
            if(x<=r){
                ans+=max(1ll*sz[x]*g[x]-1,0ll);
                ++g[x];
                ans-=max(1ll*sz[x]*g[x]-1,0ll);
            }
            else Q[x].push(r);
        }
        if(typ||i==n)cout<<ans<<" \n"[i==n];
    }
    return 0;
}
/*
*/