#pragma GCC optimize ("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define debugos clog
#define debug(v) {printf("L%d %s > ",__LINE__,#v);debugos<<(v)<<endl;}
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){debugos<<e<<" ";}debugos<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){debugos<<(m)[x]<<" ";}debugos<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){debugos<<(m)[y][x]<<" ";}debugos<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(remove_reference<remove_const<decltype(l)>::type>::type cnt=0;(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
inline void assert_call(bool assertion, function<void()> f) { if (!assertion) { cerr << "assertion fault:" << endl; f(); abort(); } }
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename Vec> inline ostream& _ostream_vecprint(ostream& os, const Vec& a) {
    os << '['; for (const auto& e : a) os << ' ' << e << ' '; os << ']'; return os;
}
template<typename T> inline ostream& operator<<(ostream& o, const vector<T>& v) { return _ostream_vecprint(o, v); }
template<typename T, size_t S> inline ostream& operator<<(ostream& o, const array<T, S>& v) { return _ostream_vecprint(o, v); }
template<typename T> inline T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& minset(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T> inline T rand(T l, T h) { return uniform_int_distribution<T>(l, h)(randdev); }
template<> inline double rand<double>(double l, double h) { return uniform_real_distribution<double>(l, h)(randdev); }
template<> inline float rand<float>(float l, float h) { return uniform_real_distribution<float>(l, h)(randdev); }


#if defined(_WIN32) || defined(_WIN64)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#elif defined(__GNUC__)
#else
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) noexcept {
            var = 0; T sign = 1;
            int cc = getchar_unlocked();
            for (; cc < '0' || '9' < cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var * sign;
        }
        inline int c() noexcept { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) noexcept { input_integer<int>(var); return *this; }
        inline MaiScanner& operator>>(long long& var) noexcept { input_integer<long long>(var); return *this; }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
    };
    class MaiPrinter {
    public:
        template<typename T>
        void output_integer(T var) noexcept {
            if (var == 0) { putchar_unlocked('0'); return; }
            if (var < 0)
                putchar_unlocked('-'),
                var = -var;
            char stack[32]; int stack_p = 0;
            while (var)
                stack[stack_p++] = '0' + (var % 10),
                var /= 10;
            while (stack_p)
                putchar_unlocked(stack[--stack_p]);
        }
        inline MaiPrinter& operator<<(char c) noexcept { putchar_unlocked(c); return *this; }
        inline MaiPrinter& operator<<(int var) noexcept { output_integer<int>(var); return *this; }
        inline MaiPrinter& operator<<(long long var) noexcept { output_integer<long long>(var); return *this; }
        inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }
        inline MaiPrinter& operator<<(const string& str) {
            const char* p = str.c_str();
            const char* l = p + str.size();
            while (p < l) putchar_unlocked(*p++);
            return *this;
        }
        template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
    };
}
MaiScanner scanner;
MaiPrinter printer;

//template<typename T>
typedef ll T;
class SegmentTree {
public:
    struct IdxVal {
        int index;
        T value;
        inline IdxVal(int _i = 0, const T& _v = T()) :index(_i), value(_v) { }
        inline void set(int i, const T& v) { index = i; value = v; }
        inline bool operator<(const T& t) const { return value < t; }
        inline bool operator==(const T& t) const { return value == t; }
        inline bool operator<(const IdxVal& iv) const { return value < iv.value || (value == iv.value && index < iv.index); }
        inline bool operator==(const IdxVal& iv) const { return index == iv.index && value == iv.value; }
    };

private:
    const int size_;
    vector<T> leaf_data_; // TODO: std::allocator
    vector<T> addnode_data_;
    vector<IdxVal> maxnode_data_;
    T* leaf_;
    T* addnode_;
    IdxVal* maxnode_;

    void _resize() {
        leaf_data_.resize(size_);
        addnode_data_.resize(size_ - 1);
        maxnode_data_.resize(size_ - 1);

        leaf_ = &leaf_data_[0];
        addnode_ = &addnode_data_[0] - 1;
        maxnode_ = &maxnode_data_[0] - 1;
    }

    void _init() {
        for (int i = size_ - 1; 0 < i; --i) {
            int c = 2 * i;
            if (size_ <= c)
                maxnode_[i].set(c - size_, leaf_[c - size_]);
            else
                maxnode_[i] = maxnode_[c];
        }
    }
public:

    inline void fill(T val) {
        std::fill(leaf_data_.begin(), leaf_data_.end(), val);
        std::fill(addnode_data_.begin(), addnode_data_.end(), 0);
        _init();
    }

    SegmentTree(int _n) :
        size_([](int _n) {int s = 8; while (s < _n) s <<= 1; return s; }(_n))
    {
        _resize();
        _init();
    }
    SegmentTree(int _n, const T& _fillVal) :
        size_([](int _n) {int s = 8; while (s < _n) s <<= 1; return s; }(_n))
    {
        _resize();
        fill(_fillVal);
    }

    // idx の要素の値を取得する
    inline T getValue(int index) const {
        T sum = leaf_[index];
        index += size_;
        while (1 < index) {
            index = index / 2; // 親へ移動
            sum += addnode_[index];
        }
        return sum;
    }

    // idx の要素の値をeに書き換える
    void setValue(int index, const T e) {
        leaf_[index] = e;

        for (int i = index + size_; 1 < i;) {
            i = i / 2;
            leaf_[index] -= addnode_[i];
        }
        {
            int c1 = index / 2 * 2;
            int c2 = index / 2 * 2;
            if (leaf_[c1] < leaf_[c2])
                maxnode_[(index + size_) / 2].set(c2, leaf_[c2]);
            else
                maxnode_[(index + size_) / 2].set(c1, leaf_[c1]);
        }
        for (int i = (index + size_) / 2; 1 < i;) {
            i = i / 2;
            int c1 = i * 2;
            int c2 = i * 2 + 1;
            if (maxnode_[c1].value < maxnode_[c2].value)
                maxnode_[i] = maxnode_[c2];
            else
                maxnode_[i] = maxnode_[c1];
        }
    }

private:
    void _addValueRange(int begin, int end, const T e, int ptr, int rangebegin, int rangeend) {

        if (rangeend <= begin || end <= rangebegin) return;
        if (begin <= rangebegin && rangeend <= end) {
            if (size_ <= ptr)
                leaf_[ptr - size_] += e;
            else
                addnode_[ptr] += e,
                maxnode_[ptr].value += e;
            return;
        }

        int rangemid = (rangebegin + rangeend) / 2;
        _addValueRange(begin, end, e, ptr * 2, rangebegin, rangemid);
        _addValueRange(begin, end, e, ptr * 2 + 1, rangemid, rangeend);

        int i1, i2;
        if (size_ <= ptr * 2) {
            int i = ptr * 2 - size_;
            if (leaf_[i] < leaf_[i + 1])
                maxnode_[ptr].set(i + 1, leaf_[i + 1]);
            else
                maxnode_[ptr].set(i, leaf_[i]);
        }
        else {
            if (maxnode_[ptr * 2].value < maxnode_[ptr * 2 + 1].value)
                maxnode_[ptr] = maxnode_[ptr * 2 + 1];
            else
                maxnode_[ptr] = maxnode_[ptr * 2];
        }
    }

private:

    IdxVal _getMaxRange(int begin, int end, int ptr, int rangebegin, int rangeend) const {

        if (rangeend <= begin || end <= rangebegin) return IdxVal(-1);
        if (begin <= rangebegin && rangeend <= end) {
            if (size_ <= ptr)
                return IdxVal(rangebegin, leaf_[rangebegin]);
            else
                return maxnode_[ptr];
        }

        int rangemid = (rangebegin + rangeend) / 2;
        auto l = _getMaxRange(begin, end, ptr * 2, rangebegin, rangemid);
        auto r = _getMaxRange(begin, end, ptr * 2 + 1, rangemid, rangeend);

        if (l.index == -1) return move(r);
        if (r.index == -1) return move(l);
        return l.value < r.value ? move(r) : move(l);
    }

public:
    // 区間[begin,end)にeを加算する
    inline void addValueRange(int begin, int end, const T e) {
        _addValueRange(begin, end, e, 1, 0, size_);
    }

    // 区間[begin,end)の最大値を計算する
    inline IdxVal getMaxRange(int begin, int end) const {
        if (end - begin <= 1) return IdxVal(begin, getValue(begin));
        return _getMaxRange(begin, end, 1, 0, size_);
    }
};


int N, Q;
int main() {

    scanner >> N >> Q;

    SegmentTree segtree(N);
    repeat(_, Q) {
        int c, s, t, x;
        scanner >> c;
        if (c == 0) {
            scanner >> s >> t >> x;
            segtree.addValueRange(s, t + 1, x);
        }
        else if (c == 1) {
            scanner >> s;
            auto e = segtree.getValue(s);
            printer << e << '\n';
        }
    }

    return 0;
}


Measured memory_bytes: 7016