11505.cpp

#include <stdio.h>
#define MOD 1000000007

long long arr[3000000];
int sIdx=1;

void update(int i, int val)
{
	i += sIdx;
	arr[i] = val;
	while(i != 1) {
		i >>= 1;
		arr[i] = (arr[i*2]*arr[i*2+1])%MOD;
	}
}

long long mul(int L, int R, int nodeNum, int nodeL, int nodeR)
{
	int mid = (nodeL+nodeR)/2;
	if(R < nodeL || nodeR < L) return 1;
	if(L <= nodeL && nodeR <= R) return arr[nodeNum];
	return (mul(L,R,nodeNum*2,nodeL,mid)*mul(L,R,nodeNum*2+1,mid+1,nodeR))%MOD;
}

int main()
{
	int i, n, m, k;
	int s, e, query;

	scanf("%d %d %d", &n, &m, &k);
	
	while(sIdx < n)
		sIdx <<= 1;

	for(i=0; i<n; i++)
		scanf("%lld", &arr[sIdx+i]);

	s=sIdx>>1; e=sIdx;
	while(s) {
		for(i=s; i<e; i++)
			arr[i] = (arr[i*2]*arr[i*2+1])%MOD;
		e = s;
		s >>= 1;
	}

	query = m+k;
	while(query--) {
		int q, a, b;
		scanf("%d %d %d", &q, &a, &b);
		if(q == 1) update(a-1, b);
		else printf("%lld\n", mul(a-1, b-1, 1, 0, sIdx-1));
	}

	return 0;
}