Problem:
Range Add Query (RAQ)

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.

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.

Constraints

1 ≤ n ≤ 100000

1 ≤ q ≤ 100000

1 ≤ s ≤ t ≤ n

1 ≤ i ≤ n

0 ≤ x ≤ 1000

Sample Input 1

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

Sample Output 1

3
5

Sample Input 2

4 3
1 2
0 1 4 1
1 2

Sample Output 2

0
1

Solution in Haskell (judge verdict: Time Limit Exceeded)

{-# OPTIONS_GHC -O3 -fexpose-all-unfoldings -fdicts-cheap -fdicts-cheap #-}

import Data.Array.Unboxed

main = do
  s <- getLine
  let [n,q] = map (read :: String -> Int) $ words s
  let arr = array (1,n) [(i,0) | i <- [1..n]] :: UArray Int Int

  prt q arr

prt q arr = do
  if q == 0 
     then return()
     else do
       s' <- getLine
       let s = map read $ words s'
       if head s == 0
          then 
            prt (q-1)  (acm (tail s) arr)
          else do
            print $ arr ! (last s)
            prt (q-1) arr 

acm [a,b,x] arr =  accum (+) arr (zip [a..b] [x,x..])