#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

typedef long long ll;

int const maxn=,mod=;

int n,m,fa[maxn],head[maxn],ct,dfn[maxn],tim;

int top[maxn],to[maxn],siz[maxn],tl[maxn],tr[maxn];

struct N{

    int to,next;

    N(int t=,int n=):to(t),next(n) {}

}edge[maxn<<];

struct T{ll s,lzy,size;}t[maxn<<];

struct Q{int l,r,z,bh;ll ansl,ansr;}q[maxn];

void add(int x,int y){edge[++ct]=N(y,head[x]);head[x]=ct;}

bool cmp(int x,int y){return q[x].l<q[y].l;}

bool cmp2(int x,int y){return q[x].r<q[y].r;}

int rd()

{

    int ret=;char ch=getchar();

    while(ch<''||ch>'')ch=getchar();

    while(ch>=''&&ch<='')ret=ret*+ch-'',ch=getchar();

    return ret;

}

void dfs(int x,int f)

{

    siz[x]=;

    for(int i=head[x];i;i=edge[i].next)

    {

        int u=edge[i].to;

        if(u==f)continue;

        dfs(u,x); siz[x]+=siz[u];

        if(siz[u]>siz[to[x]])to[x]=u;

    }

}

void dfs2(int x)

{

    dfn[x]=++tim;

    if(to[x])top[to[x]]=top[x],dfs2(to[x]);

    for(int i=head[x];i;i=edge[i].next)

    {

        int u=edge[i].to;

        if(u==fa[x]||u==to[x])continue;

        top[u]=u; //top[u]!=x !!!

        dfs2(u);

    }

}

void pushup(int x)

{

    t[x].size=t[x<<].size+t[x<<|].size;

    t[x].s=t[x<<].s+t[x<<|].s;

}

void pushdown(int x)

{

    if(!t[x].lzy)return;

    int ls=(x<<),rs=(x<<|);

    ll l=t[x].lzy;t[x].lzy=;

    t[ls].s+=l*t[ls].size; t[ls].lzy+=l;

    t[rs].s+=l*t[rs].size; t[rs].lzy+=l;

}

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

{

    if(l==r){t[x].size=; return;}

    int mid=((l+r)>>);

    build(x<<,l,mid); build(x<<|,mid+,r);

    pushup(x);

}

void update(int x,int l,int r,int L,int R)

{

    if(l>=L&&r<=R)

    {

        t[x].s+=t[x].size; t[x].lzy++;

        return;

    }

    pushdown(x);

    int mid=((l+r)>>);

    if(mid>=L)update(x<<,l,mid,L,R);

    if(mid<R)update(x<<|,mid+,r,L,R);

    pushup(x);

}

void work(int x)//x 到 rt 路径上点权+1

{

    while(x)

    {

        update(,,n,dfn[top[x]],dfn[x]);

        x=fa[top[x]];

    }

//    update(1,1,n,dfn[rt],dfn[rt]);

}

ll query(int x,int l,int r,int L,int R)

{

    if(l>=L&&r<=R)return t[x].s;

    int mid=((l+r)>>); ll ret=;

    pushdown(x);

    if(mid>=L)ret+=query(x<<,l,mid,L,R);

    if(mid<R)ret+=query(x<<|,mid+,r,L,R);

    return ret;

}

ll qry(int x)

{

    ll ret=;

    while(x)

    {

        ret+=query(,,n,dfn[top[x]],dfn[x]);

        x=fa[top[x]];

    }

    return ret;

}

int main()

{

    n=rd();m=rd();

    for(int i=;i<=n;i++){fa[i]=rd()+; add(fa[i],i); add(i,fa[i]);}

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

    {

        q[i].l=rd()+; q[i].r=rd()+; q[i].z=rd()+;

        tl[i]=i; tr[i]=i;

    }

    sort(tl+,tl+m+,cmp);

    sort(tr+,tr+m+,cmp2);

    dfs(,); top[]=; dfs2(); build(,,n);

    int dl=,dr=;

    while(q[tl[dl]].l==)dl++;

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

    {

        work(i);

        while(q[tl[dl]].l-==i&&dl<=m)

        {

            q[tl[dl]].ansl=qry(q[tl[dl]].z);//不套 dfn !!!

            dl++;

        }

        while(q[tr[dr]].r==i&&dr<=m)

        {

            q[tr[dr]].ansr=qry(q[tr[dr]].z);

            dr++;

        }

    }

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

        printf("%lld\n",(q[i].ansr-q[i].ansl)%mod);

    return ;

}