LOJ 1112

#include <bits/stdc++.h>
// #include <iostream>
// #include <cstdio>
// #include <cstdlib>
// #include <algorithm>
// #include <cmath>
// #include <vector>
// #include <set>
// #include <map>
// #include <queue>
// #include <ctime>
// #include <cassert>
// #include <complex>
// #include <string>
// #include <cstring>
// #include <queue>
// #include <bitset>

using namespace std;

// #pragma GCC optimize("Ofast,no-stack-protector")n
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")


#define ll              long long int
#define ull             unsigned long long int
#define vi              vector< int >
#define vll             vector< ll >

#define sc              scanf
#define pf              printf
#define cspf(i)         pf("Case %d:\n", i)
#define spc             pf(" ")
#define line            pf("\n")

#define ff              first
#define ss              second
#define mp              make_pair
#define pb              push_back
#define ppb             pop_back
#define tp(v,j)         get<j>(v)
#define Log(b,x)        (log(x)/log(b))

#define FOR(i,x,y)      for(int i = int(x); i < int(y); i++)
#define ROF(i,x,y)      for(int i = int(x)-1; i >= int(y); i--)
#define clr(arr,x)      memset(arr, x, sizeof arr)
#define vout(v)         for(int w=0;w<(int)v.size();w++){if(w) spc; cout<<v[w];}
#define all(v)          v.begin(), v.end()
#define rall(v)         v.rbegin(), v.rend()
#define unq(v)          sort(all(v)),(v).resize(unique(all(v))-v.begin())
#define fastIO          ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr)

#define sc1(x)          sc("%d",&x)
#define sc2(x,y)        sc("%d %d", &x, &y)
#define sc3(x,y,z)      sc("%d %d %d", &x, &y, &z)
#define scl1(x)         sc("%lld",&x);
#define scl2(x,y)       sc("%lld %lld", &x, &y)
#define scf1(x)         sc("%lf",&x)
#define scf2(x,y)       sc("%lf %lf", &x, &y)

#define pf1(x)          pf("%d",x)
#define pf2(x,y)        pf("%d %d", x, y)
#define pf3(x,y,z)      pf("%d %d %d", x, y, z)
#define pfl1(x)         pf("%lld",x)
#define pfl2(x,y)       pf("%lld %lld",x,y)

#define MOD             1000000007
#define MaxN            100001
#define MAX             (ull)(1e19)
#define inf             0x3f3f3f3f
#define PI              acos(-1.0)  // 3.1415926535897932
#define eps             1e-6

template <class T> inline T bigMod(T p,T e,T M){T ret=1; for(;e>0;e>>=1){ if(e&1) ret=(ret*p)%M; p=(p*p)%M;} return (T)ret;}
template <class T> inline T modInverse(T a,T M){return bigMod(a,M-2,M);}
template <class T> inline T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template <class T> inline T lcm(T a,T b) {a=abs(a);b=abs(b); return (a/gcd(a,b))*b;}
template <class T> inline T SQR(T a){return a*a;}

int dx[] = { 1,-1, 0, 0};                //graph moves
int dy[] = { 0, 0, 1,-1};               //graph moves

struct sqrt_dcmp{
    int sum, st, en;
}bucket[350];

int n, q, sq;
int a[MaxN];

void construct(){
    sq = ceil(sqrt((double)n));
    for(int i=0, j=0; i<n; i+=sq, j++){
        bucket[j].st = i;
        bucket[j].sum = 0;
        int k=i-1;
        for(int l=0; l<sq && k<n-1; l++){
            k++;
            bucket[j].sum += a[k];
        }
        bucket[j].en = k;
    }
}

int RangeSum(int st, int en){
    int fst = st/sq;
    int lst = en/sq;
    int sum=0;
    if(fst==lst){
        for(int i=st; i<=en; i++) sum+=a[i];
        return sum;
    }
    for(int i=st; i<=bucket[fst].en; i++) sum+=a[i];
    for(int i=fst+1; i<lst; i++) sum+=bucket[i].sum;
    for(int i=bucket[lst].st; i<=en; i++) sum+=a[i];
    return sum;
}

void addval(int inx, int val){
    a[inx] += val;
    int buck = inx/sq;
    bucket[buck].sum += val;
}

int subval(int inx){
    int buck = inx/sq;
    int val = a[inx];
    a[inx]=0;
    bucket[buck].sum -= val;
    return val;
}

int main(){

    #ifndef ONLINE_JUDGE
        clock_t tStart = clock();
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif

    int t, ca=0; sc1(t);

    while(t--){
        sc2(n, q);
        FOR(i,0,n) sc1(a[i]);
        construct();
        cspf(++ca);
        FOR(i,0,q){
            int x, inx; sc2(x, inx);
            if(x==1){
                pf1(subval(inx)); line;
            }
            else if(x==2){
                int val; sc1(val);
                addval(inx, val);
            }
            else{
                int inx2; sc1(inx2);
                pf1(RangeSum(inx, inx2)); line;
            }
        }
    }

    #ifndef ONLINE_JUDGE
        fprintf(stderr, "\n>> Runtime: %.10fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
    #endif

    return 0;
}