#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/lazysegtree>
using namespace atcoder;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define modulo 998244353
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000

pair<long long,int> op(pair<long long,int> a,pair<long long,int> b){
	a.first += b.first;
	a.second += b.second;
	return a;
}

pair<long long,int> e(){
	return make_pair(0LL,0);
}

pair<long long,int> mapping(pair<long long,int> a,pair<long long,int> b){
	if(a.second==-1)return b;
	return a;
}

pair<long long,int> composition(pair<long long,int> a,pair<long long,int> b){
	if(a.second==-1)return b;
	if(b.second==-1)return a;
	return a;
}

pair<long long,int> id(){
	return make_pair(0LL,-1);
}

int main(){
	
	int N,Q;
	cin>>N>>Q;
	
	vector<pair<long long,int>> A(N);
	rep(i,N){
		cin>>A[i].first;
		A[i].second = 1;
	}
	
	lazy_segtree<pair<long long,int>,op,e,pair<long long,int>,mapping,composition,id> seg(A);
	
	rep(i,Q){
		int T,l,r;
		cin>>T>>l>>r;
		
		int ok = N,ng = -1;
		while(ok-ng>1){
			int mid = (ok+ng)/2;
			if(seg.prod(0,mid).second >= r)ok = mid;
			else ng = mid;
		}
		r = ok;
		
		ok = N,ng = -1;
		while(ok-ng>1){
			int mid = (ok+ng)/2;
			if(seg.prod(0,mid).second >= l-1)ok = mid;
			else ng = mid;
		}
		l = ok;
		if(T==1){
			long long S = seg.prod(l,r).first;
			seg.apply(l,r,e());
			seg.set(l,make_pair(S,1));
		}
		else{
			cout<<seg.prod(l,r).first<<endl;
		}
		
	}
	
    return 0;
}