#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

template<class Val>
struct BinaryIndexedTree {
    int n;
    vector<Val> t;
    BinaryIndexedTree() {}
    BinaryIndexedTree(int _n) :n(_n + 1), t(_n + 1) {}
    void add(int k, Val val) {
        k++;
        while (k < n) {
            t[k] += val;
            k += (k&-k);
        }
    }
    void set(int k, Val val) {
        add(k, -sum(k, k + 1));
        add(k, val);
    }
    Val sum(int k) {
        Val r = 0;
        while (k > 0) {
            r += t[k];
            k -= (k&-k);
        }
        return r;
    }
    Val sum(int l, int r) {
        return sum(r) - sum(l);
    }
};

void solve() {
    int N, Q;
    cin >> N >> Q;

    BinaryIndexedTree<ll> sum(N);
    rep(i, N) {
        int a;
        cin >> a;
        sum.add(i, a);
    }

    set<pii> train;
    rep(i, N + 1) {
        train.insert(pii(i, i + 1));
    }

    auto f = [&](int x) {
        auto it = train.lower_bound(pii(x, x));
        if (it->first > x) {
            --it;
        }
        return it;
    };

    rep(i, Q) {
        int query, x;
        cin >> query >> x;
        --x;
        auto p = f(x);
        auto q = f(x + 1);
        if (query == 1) {
            if (p != q) {
                pii ne = mp(p->first, q->second);
                train.erase(p);
                train.erase(q);
                train.insert(ne);
            }
        } else if (query == 2) {
            if (p == q) {
                pii np(p->first, x + 1);
                pii nq(x + 1, p->second);
                train.erase(p);
                train.insert(np);
                train.insert(nq);
            }
        } else if (query == 3) {
            sum.add(x, 1);
        } else {
            cout << sum.sum(p->first, p->second) << endl;
        }
    }
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}