#include<iostream>
using namespace std;
int n,a[1000001],s[1000001]={1},q,op,l,d,r,k;
long long ans,maxn;
int main(){
    cin>>n>>q;
    for(int i=1;i<=n;i++) cin>>a[i],s[i]=s[i-1]*a[i];
    while(q--){
        cin>>op;
        if(op==1){
            cin>>d>>k;
            for(int i=d;i<=n;i++) s[i]=s[i]/a[d]*k;
            a[d]=k;
        }
        if(op==2){
            cin>>l>>r;
            maxn=1;
            for(int i=1;i<=r-l+1;i++){
                for(int j=l+i-1;j<=r;j++){
                    ans=(s[j]/s[j-i]);
                    maxn=(ans>maxn? ans:maxn);
                    ans=0;
                }
            }
            if(maxn>1073741824) cout<<"Too large"<<endl;
            else cout<<maxn<<endl;
        }
    }
}

https://www.luogu.com.cn/record/88400829