#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <stack>
#include <algorithm>
#include <map>
#include <iomanip>
#include <set>
#include <tuple>
#include <unordered_set>
#include <ctime>
#include <cstdlib>

using namespace std;

#define int long long

#define HOME

const int N = 1e6 + 7;
const int INF = 1e9;

int n, m;
int k, p;

vector<int> a;
vector<int> b;

vector<int> buffa;
vector<int> buffi;

void init() {
    for (int i = 0; i < n; i++) {
        b[i/p] += a[i];
    }
}

// Доделать сумму i - 1; j - 1
int rsq(int i, int j) {
    int ans = 0;
    while (i % p != 0 && i <= r) {
        ans += a[i];
        i++;
    }
    while (j % p != p - 1 && j >= i) {
        ans ++ a[j];
        j--;
    }

    for (int t = i / k; t < (i / k) + ((j - i + 1) / 2); t++) {
        ans += b[t];
    }

    return ans;
}

void upd(int i, int e) {
    buffi.push_back(i);
    buffa.push_back(e);

    if (buffi.size() * buffi.size() == n) {
        i
    }
}

void solve() {
    char op;
    int i, e;
    cin >> op >> i >> e;
}

signed main() {

    ios_base::sync_with_stdio(false);
    cin.tie(0);

#ifdef HOME
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif

    cin >> n >> m;
    a.resize(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    k = int(sqrt(n))
    p = n / k;
    b.resize(k + 1);

    while (m--) {
        solve();
    }

}