#include <iostream>
#include <algorithm>
#include <bitset>
constexpr int p(1e9+7);
int W(int k){return k>=p?k-p:k;}
struct I
{
	int len,tg;
	int c[2],s[2];
};
I operator+(const I &a,const I &b)
{
	I r;r.len=a.len+b.len;r.tg=a.tg^b.tg;
	for(int i(0);i<2;++i)
	{
		bool flg((b.len&i)^b.tg);
		r.c[i]=W(b.c[i]+(flg?p-a.c[i]:a.c[i]));
		r.s[i]=(b.s[i]+1ll*b.c[i]*(p+a.len)+(flg?p-a.s[i]:a.s[i]))%p;
	}
	return r;
}
I delp(const I &a,const I &b)
{
	I r;r.len=a.len-b.len;r.tg=a.tg^b.tg;
	for(int i(0);i<2;++i)
	{
		bool flg((r.len&i)^r.tg);
		r.c[i]=W(a.c[i]+(flg?b.c[i]:p-b.c[i]));
		r.s[i]=(a.s[i]+1ll*(p-r.c[i])*(p+b.len)+(flg?b.s[i]:p-b.s[i]))%p;
	}
	return r;
}
constexpr int K(800),N(6e5+10);
std::bitset<K> occ[N];
I ps[N<<1],ei,oi;
int off(N),vs[N],k;
struct B
{
	int tg;
	I itg;
}bs[K];
void rev(I &a)
{
	std::swap(a.c[0],a.c[1]);std::swap(a.s[0],a.s[1]);
	a.tg^=(a.len&1);
}
void shr()
{
	I las(oi);
	for(int j(1);j<=k;++j)
	{
		I nw;
		if(vs[j]-vs[j-1]==1)
		{
			nw=bs[j].itg+ps[vs[j]+off];
		}
		else
		{
			nw=delp(ps[vs[j]+off],ps[vs[j]+off-1]);
		}
		if(bs[j].tg) rev(nw),rev(las);
		ps[vs[j-1]+off]=delp(ei,bs[j].itg);
		bs[j].itg=las+bs[j].itg;
		las=nw;
	}
	--off;
}
int main()
{
	oi.len=1;oi.c[1]=1,oi.s[1]=0;
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n,qc;std::cin>>n>>qc;
	static int a[N],f[N],g[N],pos[N],bid[N],up[N],dn[N],sm[N],siz[N];
	for(int i(1);i<n;++i) std::cin>>a[i];
	for(int i(1);i<=n;++i)
	{
		if(i<n && (a[i]%2==0))
		{
			for(f[i]=2;i+f[i]-1<n && a[i+f[i]-1]%2;++f[i]);
		}
		else f[i]=1;vs[i]=f[i];
	}
	g[n]=1;
	for(int i(n-1);i;--i)
	{
		if(a[i]&1) g[i]=g[i+1]+1;
		else g[i]=1;
	}
	k=n;vs[++k]=2*n;
	std::sort(vs+1,vs+k+1);k=std::unique(vs+1,vs+k+1)-vs-1;
	for(int i(1);i<=k;++i)
	{
		I cur(ei);
		for(int j(vs[i-1]+1);j<=vs[i];++j)
		{
			bid[j]=i;
			cur=cur+oi;
			ps[off+j]=cur;
		}
	}
	for(int i(1);i<=n;++i)
	{
		int j(std::lower_bound(vs+1,vs+k+1,f[i])-vs);
		pos[i]=j;
		occ[i].set(j);occ[i]^=occ[i-1];
	}
	struct _q
	{
		int u,v,l,id;
		bool operator<(const _q &b) const {return l<b.l;}
	};
	static _q q[N];
	for(int i(1);i<=qc;++i)
	{
		std::cin>>q[i].u>>q[i].v>>q[i].l;q[i].id=i;
	}
	std::sort(q+1,q+qc+1);
	static int out[N];up[1]=0;dn[n]=0;siz[n]=1;
	for(int i(n-1);i;--i) dn[i]=1ll*a[i]*(siz[i+1]+dn[i+1])%p,siz[i]=(1ll*a[i]*siz[i+1]+1)%p;
	for(int i(2);i<=n;++i) up[i]=(up[i-1]+1ll*(a[i-1]-1)*(dn[i]+siz[i])+(siz[1]-siz[i]+p))%p;
	for(int i(1);i<=n;++i) sm[i]=(up[i]+dn[i])%p;
	for(int i(1),j(1);i<=n;++i)
	{
		shr();
		for(;j<=qc && q[j].l==i;++j)
		{
			int u(q[j].u),v(q[j].v);bool flg(false);
			if(u!=i) std::swap(u,v),flg=true;
			static std::bitset<K> sw;sw.reset();
			static int ts[10];int tc(0);ts[++tc]=2*n;
			if(u!=i)
			{
				sw^=occ[u-1]^occ[v-1];
				ts[++tc]=g[u];ts[++tc]=g[v];ts[++tc]=g[i];
			}
			else
			{
				if(v!=i)
				{
					sw^=occ[i-1]^occ[v-1];
					ts[++tc]=g[v];
				}
				else
				{
					ts[++tc]=g[i];
				}
			}
			std::sort(ts+1,ts+tc+1);
			auto qb=[&](int l,int r,int id)->I
			{
				I ret;
				if(l==vs[id-1]+1)
				{
					ret=bs[id].itg+ps[off+r];
					if(bs[id].tg^sw[id]) rev(ret);
				}
				else
				{
					ret=delp(ps[off+r],ps[off+l-1]);
					if(bs[id].tg^sw[id]) rev(ret);
				}
				return ret;
			};
			auto qry=[&](int l,int r)->I
			{
				if(l>r) return ei;
				int bl(bid[l]),br(bid[r]);
				if(bl==br) return qb(l,r,bl);
				else
				{
					I ret=qb(l,vs[bl],bl);
					for(int i(bl+1);i<br;++i) ret=ret+qb(vs[i-1]+1,vs[i],i);
					return ret+qb(vs[br-1]+1,r,br);
				}
			};
			I ans(ei);
			for(int i(k-1);i;--i) sw[i]=sw[i]^sw[i+1];
			for(int t(1);t<=tc;++t)
			{
				I cur=qry(ts[t-1]+1,ts[t]);
				if((tc-t)&1) rev(cur);
				ans=ans+cur;
			}
			int diff((1ll*(u-i+v-i)*ans.c[0]+2*ans.s[0])%p);
			out[q[j].id]=1ll*((long long)p+(flg?sm[v]-sm[u]:sm[u]-sm[v])+diff)*((p+1)/2)%p;
		}
		for(int j(1);j<=pos[i];++j) bs[j].tg^=1;
	}
	for(int i(1);i<=qc;++i) std::cout<<out[i]<<"\n";
	return 0;
}