#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>
#include <chrono>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template<typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back
template<typename T>inline bool chmax(T &a, T b){return (a < b ? a = b, true : false);}
template<typename T>inline bool chmin(T &a, T b){return (a > b ? a = b, true : false);}

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;
const long double EPS = 1e-9;

template<typename T = int>
class RangeUpdateQuery {
private:
	vector<T> data, lazy;
	int sz;
	void push(int k) {
		if (this->lazy[k]) {
			this->data[k] += this->lazy[k];
			if (k * 2 + 2 < sz * 2 - 1) {
				this->lazy[2 * k + 1] += this->lazy[k];
				this->lazy[2 * k + 2] += this->lazy[k];
			}
			this->lazy[k] = 0;
		}
	}
	void add(int l, int r, int L, int R, int k, T val) {
		if (L <= l && r <= R) {
			this->lazy[k] += val;
		} else if (R < l || r < L) {
			return;
		} else if (r - l > 1) {
			const int mid = (l + r) / 2;
			this->add(l, mid, L, R, k * 2 + 1, val);
			this->add(mid, r, L, R, k * 2 + 2, val);
		}
	}
	T query(int l, int r, int L, int R, int k) {
		this->push(k);
		if (L <= l && r <= R) {
			return data[k];
		} else if (R <= l || r <= L) {
			return 0;
		} else {
			const int mid = (l + r) / 2;
			const T left = this->query(l, mid, L, R, k * 2 + 1);
			const T right = this->query(mid, r, L, R, k * 2 + 2);
			return left + right;
		}
	}
public:
	RangeUpdateQuery(const int n) {
		this->sz = 1;
		while (this->sz < n) this->sz <<= 1;
		this->data.resize(this->sz * 2 - 1);
		this->lazy.resize(this->sz * 2 - 1);
	}
	void add(int l, int r, T val) {
		this->add(0, this->sz, l, r, 0, val);
	}
	T query(int l, int r) {
		return this->query(0, this->sz, l, r, 0);
	}
};

int main() {
	int n, q;
	cin >> n >> q;
	RangeUpdateQuery<int> ruq(n);
	while (q--) {
		//DEBUG(q)
		int num;
		cin >> num;
		if (num) {
			int idx;
			cin >> idx;
			cout << ruq.query(idx - 1, idx) << endl;
		} else {
			int s, t, x;
			cin >> s >> t >> x;
			ruq.add(s - 1, t, x);
		}
	}
}

Measured memory_bytes: 4952