Write a program which manipulates a sequence A = {a1, a2, . . . , an} with the following operations:

* add(s, t, x): add x to as, as+1, ..., at.
* get(i): output the value of ai.



Note that the initial values of ai (i = 1, 2, . . . , n) are 0.

Constraints

* 1 ≤ n ≤ 100000
* 1 ≤ q ≤ 100000
* 1 ≤ s ≤ t ≤ n
* 1 ≤ i ≤ n
* 0 ≤ x ≤ 1000

Input


n q
query1
query2
:
queryq


In the first line, n (the number of elements in A) and q (the number of queries) are given. Then, ith query queryi is given in the following format:


0 s t x


or


1 t


The first digit represents the type of the query. '0' denotes add(s, t, x) and '1' denotes get(i).

Output

For each get operation, print the value.

Examples

Input

3 5
0 1 2 1
0 2 3 2
0 3 3 3
1 2
1 3


Output

3
5


Input

4 3
1 2
0 1 4 1
1 2


Output

0
1
#include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>
#include<numeric>
#include<iostream>
#include<array>
#include<string>
#include<sstream>
#include<stack>
#include<queue>
#include<list>
#include<functional>
#define _USE_MATH_DEFINES

#include<math.h>
#include<map>

#define SENTINEL 1000000001

#define min(a,b) ((a)>(b)?(b):(a))
#define max(a,b) ((a)>(b)?(a):(b))

using namespace std;

typedef pair<int, int> pii;

int BIT[100010];

void Add(int i, int x)
{
	while (i)
	{
		BIT[i] += x;
		i -= (i&-i);
	}
}

int Get(int i)
{
	int ans = 0;
	while (i < 100010)
	{
		ans += BIT[i];
		i += (i&-i);
	}
	return ans;
}

int main()
{
	int n, q;
	scanf("%d %d", &n, &q);

	for (int i = 0; i < q; i++)
	{
		int c, s, t, v;
		scanf("%d", &c);

		switch (c)
		{
		case 0:
			scanf("%d %d %d", &s, &t, &v);
			Add(t, v);
			Add(s - 1, -v);
			break;
		case 1:
			scanf("%d", &s);
			cout << Get(s) << endl;
			break;
		}
	}

	return 0;
}
