include<bits/stdc++.h>

using namespace std;

define faster ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

define ll long long

define pll pair<long long,long long>

define all(v) v.begin(),v.end()

define pb push_back

define pii pair<int,int>

define piii int,pair<int,int>

define bit(n,i) ((n>>i)&1)

define fi first

define sc second

define pdb pair<double,double>

define db double

define endl '\n'

const long long maxn=1e6+5;
const long long minn=-1e6;
const long long MOD=1e9+7;
const long long inf=1e18;
ll n,q,a[maxn],bit[maxn];
void update(int vt,int val){
while(vt<=n){
bit[vt]+=val;
vt+=(vt&-vt);
}
}
ll getsum(int vt){
ll ans=0;
while(vt){
ans+=bit[vt];
vt-=(vt&-vt);
}
return ans;
}
ll getsumdoan(int u,int v){
return getsum(v)-getsum(u-1);
}
void nhap(){
cin>>n>>q;
for(int i=1;i<=n;i++){
cin>>a[i];
update(i,a[i]);
}
}
void solve(){
for(int i=1;i<=q;i++){
int op;cin>>op;
if(op==1){
int vt,val;cin>>vt>>val;
update(vt,val);
}else{
int u,v;cin>>u>>v;
cout<<getsumdoan(u,v)<<endl;
}
}

}
int main(){
faster
nhap();
solve();

return 0;

}

include <bits/stdc++.h>

define int long long

using namespace std;
main()
{
string s;
cin>>s;
for(int i=s.size();i>=0;i--)
cout<<s[i];
}

n = int(input())
for k in range(1,n+1):
print(k, end =" ")

for n in range(1,6):
print(n, end = " ")

n=int(input())
for k in range(n+1):
print(k,end=" ")

study

include<bits/stdc++.h>

using namespace std;
long long n,m,w[10000],v[10000],f[1000][1000];
void xuli(){
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m;j++ ){
if( j >= w[i]){
f[i][j] = max(f[i-1][j],f[i-1][j-w[i]] + v[i]);
}else{
f[i][j] = f[i-1][j];
}
}
}
}
void xuat(){
cout<<f[n][m];
}
void khoitao(){
for(int i = 0; i <= n; i++ ){
f[i][0] = 0;
}
for(int i = 0; i <= m; i++ ){
f[0][i] = 0;
}
}
int main(){
freopen("catu.inp","r",stdin);
cin>>n>>m;
for(int i = 1; i<= n; i++){
cin>>w[i]>>v[i];
}
khoitao();
xuli();
xuat();
return 0;
}