#include<cstdio>

#include<algorithm>

#include<cstring>

#include<iostream>

#include<cmath>

#include<cctype>

#include<set>

#include<queue>

#include<vector>

#include<map>

#define pa pair<int,int>

using namespace std;

typedef long long LL;

inline int read() {

    int x=,f=;char ch=getchar();for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-;

    for(;isdigit(ch);ch=getchar())x=x*+ch-'';return x*f;

}

const int N = , mod = ;

struct Edge{ int to, nxt; } e[N << ];

int head[N], sum[N << ], tag[N << ], fa[N], siz[N], son[N], bel[N], xl[N], ans[N];

int En, Index, n;

vector< pa > Que[N];

inline void add_edge(int u,int v) {

    ++En; e[En].to = v, e[En].nxt = head[u]; head[u] = En;

}

inline void pushdown(int rt,int len) {

    sum[rt << ] += (len - (len / )) * tag[rt];

    sum[rt <<  | ] += (len / ) * tag[rt];

    tag[rt << ] += tag[rt];

    tag[rt <<  | ] += tag[rt];

    tag[rt] = ;

}

void update(int l,int r,int rt,int L,int R) {

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

        tag[rt] ++; (sum[rt] += r - l + ) %= mod; return ;

    }

    if (tag[rt]) pushdown(rt, r - l + );

    int mid = (l + r) >> ;

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

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

    sum[rt] = (sum[rt << ] + sum[rt <<  | ]) % mod;

}

int query(int l,int r,int rt,int L,int R) {

    if (L <= l && r <= R) return sum[rt];

    if (tag[rt]) pushdown(rt, r - l + );

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

    if (L <= mid) res = (res + query(l, mid, rt << , L, R)) % mod;

    if (R > mid) res = (res + query(mid + , r, rt <<  | , L, R)) % mod;

    return res;

}

void dfs1(int u) {

    siz[u] = ;

    for (int i = head[u]; i; i = e[i].nxt) {

        int v = e[i].to;

        dfs1(v);

        siz[u] += siz[v];

        if (!son[u] || siz[son[u]] < siz[v]) son[u] = v;

    }

}

void dfs2(int u,int top) {

    bel[u] = top;

    xl[u] = ++Index;

    if (!son[u]) return ;

    dfs2(son[u], top);

    for (int i = head[u]; i; i = e[i].nxt)

        if (e[i].to != son[u]) dfs2(e[i].to, e[i].to);

}

void add(int x) {

    while (x) {

        update(, n, , xl[bel[x]], xl[x]);

        x = fa[bel[x]];

    }

}

int query(int x) {

    int ans = ;

    while (x) {

        ans = (ans + query(, n, , xl[bel[x]], xl[x])) % mod;

        x = fa[bel[x]];

    }

    return ans;

}

int main() {

    n = read();int m = read();

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

        fa[i] = read() + ;

        add_edge(fa[i], i);

    }

    dfs1();

    dfs2(, );

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

        int l = read() + , r = read() + , z = read() + ;

        Que[r].push_back(pa(z, i));

        Que[l - ].push_back(pa(z, -i));

    }

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

        add(i);

        for (int sz = Que[i].size(), j = ; j < sz; ++j) {

            if (Que[i][j].second < ) ans[-Que[i][j].second] -= query(Que[i][j].first);

            else ans[Que[i][j].second] += query(Que[i][j].first);

        }

    }

    for (int i = ; i <= m; ++i) printf("%d\n", (ans[i] + mod) % mod);

    return ;

}