#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <set>
#define pii pair<int,int>
#define fi first
#define sc second
#define mkp make_pair
using namespace std;
const int N=5e5+5;
int n,q,a[N];
unsigned long long b[N],bb[N];
set<pii> S;
set<pii>::iterator it,It;

inline int read() {
    int x=0,fl=0;char ch=getchar();
    while(ch<'0'||ch>'9') {fl|=(ch=='-'); ch=getchar();}
    while('0'<=ch&&ch<='9') {x=(x<<3)+(x<<1)+ch-'0'; ch=getchar();}
    return fl?-x:x;
}
inline int mx(int x,int y) {return x>y?x:y;}
inline int mn(int x,int y) {return x<y?x:y;}

struct Sgt {
    struct Node {
        unsigned long long sm,tg;
        bool Tg;
    }w[N<<2];
    inline void pu(int ht) {w[ht].sm=w[ht<<1].sm+w[ht<<1|1].sm;}
    inline void pd(int ht,int ln,int rn) {
        if(w[ht].Tg) {
            w[ht<<1].Tg=1;
            w[ht<<1].sm=w[ht<<1].tg=0;
            w[ht<<1|1].Tg=1;
            w[ht<<1|1].sm=w[ht<<1|1].tg=0;
            w[ht].Tg=0;
        }
        if(w[ht].tg) {
            w[ht<<1].tg+=w[ht].tg;
            w[ht<<1].sm+=1ull*ln*w[ht].tg;
            w[ht<<1|1].tg+=w[ht].tg;
            w[ht<<1|1].sm+=1ull*rn*w[ht].tg;
            w[ht].tg=0;
        }
    }
    void update(int l,int r,int ht,int L,int R,unsigned long long qwq) {
        if(L<=l&&r<=R) {
            w[ht].sm+=1ull*(r-l+1)*qwq;
            w[ht].tg+=qwq;
            return ;
        } int mid=(l+r)>>1; pd(ht,mid-l+1,r-mid);
        if(L<=mid) update(l,mid,ht<<1,L,R,qwq);
        if(R> mid) update(mid+1,r,ht<<1|1,L,R,qwq);
        pu(ht);
    }
    void Update(int l,int r,int ht,int L,int R) {
        if(L<=l&&r<=R) {
            w[ht].Tg=1;
            w[ht].sm=w[ht].tg=0;
            return ;
        } int mid=(l+r)>>1; pd(ht,mid-l+1,r-mid);
        if(L<=mid) Update(l,mid,ht<<1,L,R);
        if(R> mid) Update(mid+1,r,ht<<1|1,L,R);
        pu(ht);
    }
    unsigned long long query(int l,int r,int ht,int L,int R) {
        if(L<=l&&r<=R) return w[ht].sm;
        int mid=(l+r)>>1; pd(ht,mid-l+1,r-mid);
        if(L<=mid) {
            if(R>mid) return query(l,mid,ht<<1,L,R)+query(mid+1,r,ht<<1|1,L,R);
            else return query(l,mid,ht<<1,L,R);
        } else return query(mid+1,r,ht<<1|1,L,R);
    }
}w1,w2;
inline void prep() {
    int l=1,r;
    while(l<=n) {
        r=l;while(r<=n&&a[r]==a[l])++r;--r;
        S.insert(mkp(l,r));
        l=r+1;
    }
}
inline void Ins(int l,int r,int tm) {
    bb[l]=1ull*tm*w1.query(1,n,1,l,r);
    S.insert(mkp(l,r));
}
inline void Era(int l,int r,int tm) {
    b[a[l]]+=(1ull*tm*w1.query(1,n,1,l,r)-bb[l]-w2.query(1,n,1,l,r));bb[l]=0;
    w2.Update(1,n,1,l,r);
}
inline void work1(int l,int r,int p,int T) {
    it=S.lower_bound(mkp(l,0));
    if((*it).fi!=l) {
        --it;
        Era((*it).fi,(*it).sc,T);
        Ins((*it).fi,l-1,T);
        It=it; ++It; S.erase(it); it=It;
    }
    while(it!=S.end()&&(*it).sc<=r) {
        Era((*it).fi,(*it).sc,T);
        It=it; ++It; S.erase(it); it=It;
    }
    if(it!=S.end()&&(*it).fi<=r) {
        Era((*it).fi,(*it).sc,T);
        Ins(r+1,(*it).sc,T);
        S.erase(it);
    }
    a[l]=p;Ins(l,r,T);
}
inline void work2(int l,int r,int p,int T) {
    w1.update(1,n,1,l,r,1ull*p);
    w2.update(1,n,1,l,r,1ull*T*p);
}
int main() {
#ifndef ONLINE_JUDGE
    freopen("1.in","r",stdin);
    freopen("1.out","w",stdout);
#endif
    n=read();q=read();
    for(int i=1;i<=n;++i) a[i]=read();
    prep();
    for(int i=1,op,l,r,p;i<=q;++i) {
        op=read();l=read();r=read();p=read();
        if(op==1) work1(l,r,p,i);
        else work2(l,r,p,i);
    }
    it=S.begin();
    while(it!=S.end()) {
        Era((*it).fi,(*it).sc,q+1);
        It=it; ++It; S.erase(it); it=It;
    }
    for(int i=1;i<=n;++i) printf("%llu ",b[i]);
    printf("\n");
    return 0;
}