Rainbow built h cells in a row that are numbered from 1 to h from left to right. There are n cells with treasure. We call each of these n cells "Treasure Cell". The i -th "Treasure Cell" is the a i -th cell and the value of treasure in it is c i dollars. Then, Freda went in the first cell. For now, she can go just k cells forward, or return to the first cell. That means Freda was able to reach the 1st, ( k + 1 )-th, ( 2· k + 1 )-th, ( 3· k + 1 )-th cells and so on. Then Rainbow gave Freda m operations. Each operation is one of the following three types: Add another method x : she can also go just x cells forward at any moment. For example, initially she has only one method k . If at some moment she has methods a 1 , a 2 , ..., a r then she can reach all the cells with number in form , where v i — some non-negative integer. Reduce the value of the treasure in the x -th "Treasure Cell" by y dollars. In other words, to apply assignment c x = c x - y . Ask the value of the most valuable treasure among the cells Freda can reach. If Freda cannot reach any cell with the treasure then consider the value of the most valuable treasure equal to 0, and do nothing. Otherwise take the most valuable treasure away. If several "Treasure Cells" have the most valuable treasure, take the "Treasure Cell" with the minimum number (not necessarily with the minimum number of cell). After that the total number of cells with a treasure is decreased by one. As a programmer, you are asked by Freda to write a program to answer each query. The first line of the input contains four integers: h (1 ≤ h ≤ 10 18 ), n , m (1 ≤ n , m ≤ 10 5 ) and k (1 ≤ k ≤ 10 4 ) . Each of the next n lines contains two integers: a i (1 ≤ a i ≤ h ), c i (1 ≤ c i ≤ 10 9 ) . That means the i -th "Treasure Cell" is the a i -th cell and cost of the treasure in that cell is c i dollars. All the a i are distinct. Each of the next m lines is in one of the three following formats: "1 x " — an operation of type 1, 1 ≤