#include<bits/stdc++.h>
#define int long long
using namespace std;
#define fi first
#define sc second
#define pii pair<int,int>
#define pdd pair<double,double>
#define pb push_back
#define umap unordered_map
#define mset multiset
#define pq priority_queue
#define ull unsigned long long
#define i128 __int128
#define ld long double
#define fixs fixed<<setprecision
#define FileIn(x) freopen(x".in","r",stdin)
#define FileOut(x) freopen(x".out","w",stdout)
#define FileIO(x) FileIn(x),FileOut(x);
const int maxn=1e6+10;
int lb(int x){
    return x&(-x);
}
struct BIT{
    int c[maxn],N;
    void init(int n){
        N=n;
        for(int i=1;i<=n;i++) c[i]=0;
    }
    void upd(int x,int k){
        for(;x<=N;x+=lb(x)) c[x]+=k;
    }
    int query(int x){
        int sum=0;
        for(;x;x-=lb(x)) sum+=c[x];
        return sum;
    }
}tr;
int n,q;
set<int> s;
void solve(){
    cin>>n>>q,tr.init(n);
    for(int i=0;i<=n;i++) s.insert(i);
    for(int i=1,x;i<=n;i++) cin>>x,tr.upd(i,x);
    while(q--){
        int op,x;
        cin>>op>>x;
        if(op==1) s.erase(x);
        if(op==2) s.insert(x);
        if(op==3) tr.upd(x,1);
        if(op==4){
            auto r=s.lower_bound(x),l=r;
            l--;
            cout<<tr.query(*r)-tr.query(*l)<<endl;
        }
    }
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--) solve();
    return 0;
}
/*
Samples
input:

output:

THINGS TODO:
检查freopen，尤其是后缀名
检查空间
检查调试语句是否全部注释
*/