#include<cstdio>

#include<algorithm>

using namespace std;

#define N 100050

#define ui unsigned int

int n,Q;

struct pla

{

    int d,v;

}p[N];

bool cmp(pla a,pla b)

{

    return a.d<b.d;

}

struct segtree

{

    ui mn;

    ui v[];

}tr[*N];

segtree operator * (segtree s0,segtree s1)

{

    segtree ret;

    for(int i=;i<=;i++)

    {

        ret.v[i]=s0.v[i]+s1.v[i];

        for(int j=;j<i;j++)ret.v[i]+=s0.v[j]*s1.v[i-j];

    }

    ret.mn = min(s0.mn,s1.mn);

    ui mx = max(s0.mn,s1.mn);

    for(int i=;i>=;i--)

    {

        ret.v[i]+=ret.v[i-]*mx;

    }

    ret.v[]+=mx;

    return ret;

}

void update(int u)

{

    tr[u] = tr[u<<] * tr[u<<|];

}

void build(int l,int r,int u)

{

    if(l==r)

    {

        tr[u].mn=(ui)p[l].v;

        return ;

    }

    int mid = (l+r)>>;

    build(l,mid,u<<);

    build(mid+,r,u<<|);

    update(u);

}

segtree query(int l,int r,int u,int ql,int qr)

{

    if(l==ql&&r==qr)return tr[u];

    int mid = (l+r)>>;

    if(ql>mid)return query(mid+,r,u<<|,ql,qr);

    else if(qr<=mid) return query(l,mid,u<<,ql,qr);

    else

    {

        segtree s0=query(l,mid,u<<,ql,mid);

        segtree s1=query(mid+,r,u<<|,mid+,qr);

        segtree ret = s0 * s1;

        return ret;

    }

}

ui jc[];

int mi[];

int findl(int d)

{

    int a = n;

    for(int i=;i>=;i--)

    {

        if(a-mi[i]<=)continue;

        if(p[a-mi[i]].d>=d)a-=mi[i];

    }

    return a;

}

int findr(int d)

{

    int a = ;

    for(int i=;i>=;i--)

    {

        if(a+mi[i]>n)continue;

        if(p[a+mi[i]].d<=d)a+=mi[i];

    }

    return a;

}

int main()

{

//    freopen("c.in","r",stdin);

//    freopen("c.out","w",stdout);

    scanf("%d%d",&n,&Q);

    jc[]=,jc[]=,jc[]=,jc[]=,jc[]=,jc[]=;

    mi[]=;

    for(int i=;i<=;i++)mi[i]=mi[i-]<<;

    for(int i=;i<=n;i++)scanf("%d",&p[i].d);

    for(int i=;i<=n;i++)scanf("%d",&p[i].v);

    sort(p+,p++n,cmp);

    build(,n,);

    for(int ll,rr,l,r,k,i=;i<=Q;i++)

    {

        scanf("%d%d%d",&ll,&rr,&k);

        l = findl(ll);

        r = findr(rr);

        if(l>r)

        {

            printf("0\n");

            continue;

        }

        segtree ans;

        ans = query(,n,,l,r);

        printf("%u\n",ans.v[k]*jc[k]);

    }

    fclose(stdin);

    fclose(stdout);

    return ;

}