#include<cmath>
#include<cstdio>
#include<bitset>
#include<cstring>
#include<iostream>
#include<algorithm>

using namespace std;

#define N 100000
#define T 25000

int a[N+1],b[N+1];

int S,bl[N+1];

bitset<N>F[T+1],f;

int cnt[N+1];

bool mark[T+1
 
];
int ans[T+1];

struct node
{
    int id,l,r;
}e[T*3+1];

void read(int &x)
{
    x=0; char c=getchar();
    while(!isdigit(c)) c=getchar();
    while(isdigit(c)) { x=x*10+c-'0'; c=getchar(); }
}

bool cmp(node p,node q)
{
    if(bl[p.l]!=bl[q.l]) return bl[p.l]<bl[q.l];
    
 
return p.r<q.r;
}

void update(int pos,bool ty)
{
    int x=a[pos];
    if(ty)
    {
        cnt[x]++;
        f[x+cnt[x]-2]=1;
    }
    else
    {
        f[x+cnt[x]-2]=0;
        cnt[x]--;
    }
}

void solve(int t)
{
    int n=0;
    memset(mark,false,sizeof(mark));
    memset(ans,
 
0,sizeof(ans));
    for(int i=1;i<=t;++i)
    {
        read(e[++n].l); read(e[n].r);
        e[n].id=i;
        ans[i]+=e[n].r-e[n].l+1;
        read(e[++n].l); read(e[n].r);
        e[n].id=i;
        ans[i]+=e[n].r-e[n].l+1;
        read(e[++n].l); read(e[n].r);
        e[n].id=i;
        ans[i]+=e[n].r-e[n].l+1;
    }
    sort(e+1,e+n+1,cmp);
    f.reset();
    memset(cnt,0,sizeof(cnt));
    int L=1,R=0;
    for(int i=1;i<=n;++i)
    {
        while(R<e[i].r) update(++R,true);
        while(R>e[i].r) update(R--,false);
        while(L<e[i].l) update(L++,false);
        while(L>e[i].l) update(--L,true);
        if(!mark[e[i].id]) F[e[i].id]=f,mark[e[i].id]=true;
        else F[e[i].id]&=f;
    }
    for(int i=1;i<=t;++i) 
    {
        ans[i]-=F[i].count()*3;
        printf("%d\n",ans[i]);
    }    
}

int main()
{
    //freopen("xp1.in","r",stdin); 
    //freopen("xp1.ans","w",stdout);
    int n,m;
    read(n); read(m);
    S=sqrt(n);
    for(int i=1;i<=n;++i) bl[i]=(i-1)/S+1;
    for(int i=1;i<=n;++i) read(a[i]),b[i]=a[i];
    sort(b+1,b+n+1);
    for(int i=1;i<=n;++i) a[i]=lower_bound(b+1,b+n+1,a[i])-b;
    while(m)
    {
        if(m<=T) solve(m),m=0;
        else solve(T),m-=T;
    }
    return 0;
}