#include using namespace std; #include using namespace atcoder; using mint=modint998244353; //1000000007; using ll=long long; using pp=pair; #define sr string #define vc vector #define fi first #define se second #define rep(i,n) for(ll i=0;i<(ll)n;i++) #define pb push_back #define all(v) v.begin(),v.end() #define pque priority_queue #define bpc(a) __builtin_popcount(a) int main(){ ll n,q;cin>>n>>q; fenwick_treefw(n); vcv(n+1,0); rep(i,n)cin>>v[i+1]; rep(i,n)v[i+1]+=v[i]; rep(z,q){ ll t,l,r;cin>>t>>l>>r; l--; if(t==1)fw.add(l,r-l-1); else{ l+=fw.sum(0,l); r+=fw.sum(0,r); ll ans=v[r]-v[l]; cout<