Author:  М. Спорышев  Time limit:  1 sec  
Input file:  Standard input  Memory limit:  512 Mb  
Output file:  Standard output 
Young farmer Alice has N grasshoppers. Grasshoppers sit along the line, ith grasshopper at coordinate x_{i}, measured in centimeters. Several grasshoppers may occupy the same point. A grasshopper is alone, if there is no other grasshopper at its position.
Alice wants to herd grasshoppers into the box which is located at position 0.
To do that, Alice can move to any point p on the line and clap loudly. After each clap, any grasshopper that is either
Once grasshopper reaches the box, it stays there and does not jump anymore.
Your program must determine the minimum number of claps required to get all grasshoppers into the box.
First line of input contains two integers N and C.
Next line contains N integers x_{i} in ascending order.
Output must contain a single integer — the minimum number of claps.
1 ≤ N, C ≤ 10^{5}
1 ≤ x_{i − 1} ≤ x_{i} ≤ 10^{9}
No.  Standard input  Standard output 

1 


2 

