There is an array of $n$ elements, initially filled with zeros. You need to write a data structure that processes two types of queries:

• add $v$ to the segment from $l$ to $r−1$,
• find the minimum on the segment from $l$ to $r−1$.

The first line contains two numbers $n,m\ (1≤n,m≤100,000)$, the size of the array and the number of operations. 

The following lines contain the description of the operations. The description of each operation is as follows:

• 1 l r v: add $v$ to the segment from $l$ to $r−1\ (0≤l<r≤n,\ 0≤v≤10^9)$.
• 2 l r: find the minimum on the segment from $l$ to $r−1\ (0≤l<r≤n)$.

For each operation of the second type, print the corresponding value.