Motorist Kojiro spent 10 years saving up for his favorite car brand, Furrari. Finally Kojiro's dream came true! Kojiro now wants to get to his girlfriend Johanna to show off his car to her. Kojiro wants to get to his girlfriend, so he will go to her along a coordinate line. For simplicity, we can assume that Kojiro is at the point f of a coordinate line, and Johanna is at point e . Some points of the coordinate line have gas stations. Every gas station fills with only one type of fuel: Regular-92 , Premium-95 or Super-98 . Thus, each gas station is characterized by a pair of integers t i and x i — the number of the gas type and its position. One liter of fuel is enough to drive for exactly 1 km (this value does not depend on the type of fuel). Fuels of three types differ only in quality, according to the research, that affects the lifetime of the vehicle motor. A Furrari tank holds exactly s liters of fuel (regardless of the type of fuel). At the moment of departure from point f Kojiro's tank is completely filled with fuel Super-98 . At each gas station Kojiro can fill the tank with any amount of fuel, but of course, at no point in time, the amount of fuel in the tank can be more than s liters. Note that the tank can simultaneously have different types of fuel. The car can moves both left and right. To extend the lifetime of the engine Kojiro seeks primarily to minimize the amount of fuel of type Regular-92 . If there are several strategies to go from f to e , using the minimum amount of fuel of type Regular-92 , it is necessary to travel so as to minimize the amount of used fuel of type Premium-95 . Write a program that can for the m possible positions of the start f i minimize firstly, the amount of used fuel of type Regular-92 and secondly, the amount of used fuel of type Premium-95 . The first line of the input contains four positive integers e , s , n , m ( 1 ≤ e , s ≤ 10 9 , 1 ≤ n , m ≤ 2·10 5 ) — the coordinate of the point where Johanna is, the cap