-><-

#include<bits/stdc++.h>
#define nl "\n"
#define fi first
#define se second
#define pi 3.14159
#define ll long long
#define odd(a)  (a&1)
#define even(a)  !(a&1)
#define Mod 1'000'000'007
#define INF 2'000'000'000
#define sz(x) int(x.size())
#define charToInt(s) (s - '0')
#define ull unsigned long long
#define number_line iota(all(vec) , 1)
#define all(s) s.begin(), s.end()
#define rall(v) v.rbegin() , v.rend()
#define fixed(n) fixed << setprecision(n)
#define Num_of_Digits(n) ((int)log10(n) + 1)
#define to_decimal(bin) stoll(bin, nullptr, 2)
#define Ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define Floor(n, m) (((n) / (m)) - ((n) % (m) ? 0 : 1))
#define Upper(s) transform(all(s), s.begin(), ::toupper);
#define Lower(s) transform(all(s), s.begin(), ::tolower);
#define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
//  ----- bits-------
#define pcnt(n) __builtin_popcount(n)
#define pcntll(n) __builtin_popcountll(n)
#define clz(n) __builtin_clz(n)    // <---100
#define clzll(n) __builtin_clzll(n)
#define ctz(n) __builtin_ctz(n)  // 0001---->
#define ctzll(n) __builtin_ctzll(n)

using namespace std;

template < typename T = int > istream& operator >> (istream &in, vector < T > & v){
    for(auto & x : v) in >> x;
    return in;
}

template < typename T = int > ostream& operator << (ostream &out, const vector < T > & v){
    for(const T & x : v) out << x << " ";
    return out;
}
void esraa()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}
template < typename T >
struct FenwickTree{
    vector < T > tree;
    int n;
    FenwickTree(int _n){
        n = _n;
        tree.resize(n + 1);
    }
    void add(int idx, T val){
        while(idx <= n){
            tree[idx] += val;
            idx += (idx & -idx);
        }
    }
    T sum(int idx){
        T ret = 0;
        while(idx > 0){
            ret += tree[idx];
            idx -= (idx & -idx);
        }
        return ret;
    }
    T sum(int l, int r){
        if(l > r) return 0;
        return sum(r) - sum(l - 1);
    }
    void upadte_range(int l, int r, T val){
        add(l, val);
        add(r + 1 , -val);
    }
    T get(int idx){
        return sum(idx, idx);
    }
};
void solve(){
    int n, q;
    cin >> n >> q;
    FenwickTree < ll > tree(n);
    vector < ll > v(n);
    cin >> v;
    for(int i = 0; i < n; i++){
        tree.add(i + 1, v[i]);
    }
    while(q--){
        int type;
        cin >> type;
        if(type == 1){
            int l, r, val;
            cin >> l >> r >> val;
            tree.upadte_range(l, r, val);
        }else{
            int idx;
            cin >> idx;
            cout << tree.get(idx) << nl;
        }
    }
}
int main()
{
    esraa();
    int t = 1;
    //cin >> t;
    while(t--)
      solve();
    return 0;
}