This documentation is automatically generated by online-judge-tools/verification-helper
#define PROBLEM "https://judge.yosupo.jp/problem/point_add_range_sum"
#include <iostream>
#include "atcoder/fenwicktree.hpp"
int main() {
int n, q;
std::cin >> n >> q;
atcoder::fenwick_tree<long long> ft(n);
for (int i = 0; i < n; i++) {
long long a;
std::cin >> a;
ft.add(i, a - ft.sum(i, i + 1));
}
while (q--) {
int t;
std::cin >> t;
if (t == 0) {
int p;
long long x;
std::cin >> p >> x;
long long d = ft.sum(p, p + 1) + x;
ft.add(p, d - ft.sum(p, p + 1));
}
if (t == 1) {
int l, r;
std::cin >> l >> r;
std::cout << ft.sum(l, r) << '\n';
}
}
}
#line 1 "test/library-checker/point_set_range_sum.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/point_add_range_sum"
#include <iostream>
#line 1 "atcoder/fenwicktree.hpp"
#include <cassert>
#include <vector>
#line 1 "atcoder/internal_type_traits.hpp"
#line 5 "atcoder/internal_type_traits.hpp"
#include <numeric>
#include <type_traits>
namespace atcoder {
namespace internal {
#ifndef _MSC_VER
template <class T>
using is_signed_int128 =
typename std::conditional<std::is_same<T, __int128_t>::value ||
std::is_same<T, __int128>::value,
std::true_type,
std::false_type>::type;
template <class T>
using is_unsigned_int128 =
typename std::conditional<std::is_same<T, __uint128_t>::value ||
std::is_same<T, unsigned __int128>::value,
std::true_type,
std::false_type>::type;
template <class T>
using make_unsigned_int128 =
typename std::conditional<std::is_same<T, __int128_t>::value,
__uint128_t,
unsigned __int128>;
template <class T>
using is_integral = typename std::conditional<std::is_integral<T>::value ||
is_signed_int128<T>::value ||
is_unsigned_int128<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using is_signed_int = typename std::conditional<(is_integral<T>::value &&
std::is_signed<T>::value) ||
is_signed_int128<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using is_unsigned_int =
typename std::conditional<(is_integral<T>::value &&
std::is_unsigned<T>::value) ||
is_unsigned_int128<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using to_unsigned = typename std::conditional<
is_signed_int128<T>::value,
make_unsigned_int128<T>,
typename std::conditional<std::is_signed<T>::value,
std::make_unsigned<T>,
std::common_type<T>>::type>::type;
#else
template <class T> using is_integral = typename std::is_integral<T>;
template <class T>
using is_signed_int =
typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using is_unsigned_int =
typename std::conditional<is_integral<T>::value &&
std::is_unsigned<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using to_unsigned = typename std::conditional<is_signed_int<T>::value,
std::make_unsigned<T>,
std::common_type<T>>::type;
#endif
template <class T>
using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;
template <class T>
using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;
template <class T> using to_unsigned_t = typename to_unsigned<T>::type;
} // namespace internal
} // namespace atcoder
#line 8 "atcoder/fenwicktree.hpp"
namespace atcoder {
// Reference: https://en.wikipedia.org/wiki/Fenwick_tree
template <class T> struct fenwick_tree {
using U = internal::to_unsigned_t<T>;
public:
fenwick_tree() : _n(0) {}
explicit fenwick_tree(int n) : _n(n), data(n) {}
void add(int p, T x) {
assert(0 <= p && p < _n);
p++;
while (p <= _n) {
data[p - 1] += U(x);
p += p & -p;
}
}
T sum(int l, int r) {
assert(0 <= l && l <= r && r <= _n);
return sum(r) - sum(l);
}
private:
int _n;
std::vector<U> data;
U sum(int r) {
U s = 0;
while (r > 0) {
s += data[r - 1];
r -= r & -r;
}
return s;
}
};
} // namespace atcoder
#line 5 "test/library-checker/point_set_range_sum.test.cpp"
int main() {
int n, q;
std::cin >> n >> q;
atcoder::fenwick_tree<long long> ft(n);
for (int i = 0; i < n; i++) {
long long a;
std::cin >> a;
ft.add(i, a - ft.sum(i, i + 1));
}
while (q--) {
int t;
std::cin >> t;
if (t == 0) {
int p;
long long x;
std::cin >> p >> x;
long long d = ft.sum(p, p + 1) + x;
ft.add(p, d - ft.sum(p, p + 1));
}
if (t == 1) {
int l, r;
std::cin >> l >> r;
std::cout << ft.sum(l, r) << '\n';
}
}
}