Problem: 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

Solution (in CPP):

Solution:
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;i>=0;i--)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
typedef long long ll;

template <class T> struct FenwickTree {
   vector<T> node;
   FenwickTree(int n) : node(n,0) {}
   void add(int idx, T val) {
      while (idx < node.size()) {
         node[idx] += val;
         idx += idx & -idx;
      }
   }
   T sum(int idx) {
      T ret = 0;
      while (idx > 0) {
         ret += node[idx];
         idx -= idx & -idx;
      }
      return ret;
   }
};

int main() {

   int n,q; cin >> n >> q;
   FenwickTree<int> inst(100010);
   REP(i,q){
      int com,s,t,x;
      cin >> com;
      if(com == 0) {
         cin >> s >> t >> x;
         inst.add(s,x);
         inst.add(t+1,-x);
      } else{
         cin >> t;
         cout << inst.sum(t) << endl;
      }
   }

   return 0;
}