rt，提交记录

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
#include<cassert>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#include<cstdlib>
using namespace std;
#define ll long long
#define ull unsigned long long
#define int ll
int read()
{
	int now=0,nev=1;
	char c=getchar();
	while(c<'0' || c>'9')
	{
		if(c=='-')
			nev=-1;
		c=getchar();
	}
	while(c>='0' && c<='9')
	{
		now=(now<<1)+(now<<3)+(c&15);
		c=getchar();
	}
	return now*nev;
}
const int MAXN=1e6+10;
const int mod=1e9+7;
int n,m;
int w[MAXN];
struct tree
{
	int l,r;
	int sum,pfsum;
}tr[MAXN];
void pushup(int k)
{
	tr[k].sum=(tr[k<<1].sum+tr[k<<1|1].sum)%mod;
	tr[k].pfsum=(tr[k<<1].pfsum+tr[k<<1|1].pfsum)%mod;
}
void build(int k,int l,int r)
{
	tr[k].l=l,tr[k].r=r;
	if(l==r)
	{
		tr[k].sum=w[l]%mod;
		tr[k].pfsum=tr[k].sum*tr[k].sum%mod;
		return ;
	}
	int m=l+r>>1;
	build(k<<1,l,m);
	build(k<<1|1,m+1,r);
	pushup(k);
}
void modefy(int k,int x,int v)
{
	if(tr[k].l==tr[k].r)
	{
		tr[k].pfsum=v*v%mod;
		tr[k].sum=v%mod;
		return ;
	}
	int m=tr[k].l+tr[k].r>>1;
	if(x<=m)
		modefy(k<<1,x,v);
	if(x>m)
		modefy(k<<1|1,x,v);
	pushup(k);
}
int query_sum(int k,int l,int r)
{
	if(l<=tr[k].l && tr[k].r<=r)
		return tr[k].sum%mod;
	int m=tr[k].l+tr[k].r>>1;
	int res=0;
	if(l<=m)
		res=(res+query_sum(k<<1,l,r))%mod;
	if(r>m)
		res=(res+query_sum(k<<1|1,l,r))%mod;
	return res%mod;
}
int query_pfsum(int k,int l,int r)
{
	if(l<=tr[k].l && tr[k].r<=r)
		return tr[k].pfsum%mod;
	int m=tr[k].l+tr[k].r>>1;
	int res=0;
	if(l<=m)
		res=(res+query_pfsum(k<<1,l,r))%mod;
	if(r>m)
		res=(res+query_pfsum(k<<1|1,l,r))%mod;
	return res%mod;
}
int inv(int x)
{
	if(x==1)
		return 1;
	if(x<1)
		return 0;
	return (mod-mod/x)*inv(mod%x)%mod;
}
signed main()
{
	n=read(),m=read();
	for(int i=1;i<=n;i++)
		w[i]=read();
	build(1,1,n);
	for(int i=1;i<=m;i++)
	{
		int op,x,y;
		op=read();
		if(op==1)
		{
			x=read(),y=read();
			modefy(1,x,y);
		}
		if(op==2)
		{
			x=read(),y=read();
			int avg=query_sum(1,x,y)*inv(y-x+1)%mod;
			printf("%lld\n",(query_pfsum(1,x,y)+avg*avg%mod*(y-x+1)%mod-2*avg*query_sum(1,x,y)+10*mod)*inv(y-x+1)%mod);
		}
	}
	return 0;
}