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 <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
typedef long long ll;
class Binaryindextree{
  private:
    vector<ll>v;
  public:
    Binaryindextree(int n):v(n + 1){}
    ll sum(int i){
      ll res = 0;
      for(++i; i > 0; i -= i & -i)res += v[i];
      return res;
    }
    void add(int i,ll t){
      for(++i; i < v.size(); i += i & -i)v[i] += t;
      return;
    }
};
int main(){
  int n,q;
  cin >> n >> q;
  Binaryindextree BIT(n);
  rep(i,q){
    int Q;
    cin >> Q;
    if(Q){
      int num;
      cin >> num;
      cout << BIT.sum(num - 1) << endl;
    }
    else{
      int a,b,c;
      cin >> a >> b >> c;
      BIT.add(a - 1,c);
      BIT.add(b,-c);
    }
  }
  return 0;
}
