The most annoying thing in Moscow traffic jams is that drivers constantly try to suddenly change lanes in order to move faster. In this problem you'll have to find out whether this is a reasonable strategy or not.

We'll study a relatively simple mathematical model of a traffic jam. Assume that there's an N-lane road, lanes numbered from 1 to N, and i^th lane is moving with speed b_i+a_i·sin(t+δ_i) at the moment t. It is always true that b_i > a_i, i.e., the speed of movement is always positive. You can change the lane you're in at any time, it takes c·|x-y| to change from x^th lane to y^th. We'll assume that you're not moving forward during that period.

Determine the time you need to travel the distance of d, and the method of achieving that time. You're starting at the moment 0 at lane 1, you may finish at any lane.

The first line of input contains two integers N and d and a floating-point number c, 1 ≤ N ≤ 5, 1 ≤ d ≤ 1000, 0.001 ≤ c ≤ 1000. The next N lines describe lanes, each containing two integers a_i and b_i and a floating-point number δ_i, 0 ≤ a_i < b_i ≤ 100, 0 ≤δ_i < 2π.

On the first line of output print the minimal time required to travel the distance of d. On the second line of output print the number K of lane changes required to do that. K should not be more than 10⁶, it is guaranteed that there always exists an optimal strategy requiring not more than 10⁶ lane changes. On the next K lines print the changes themselves, each line should contain the new lane number and the time when the change is started. The changes should be printed in chronological order. If there're many possible schedules, output any.

Output all the floating-point numbers with maximal precision possible. Your solution will be considered correct if verifying your schedule doesn't lead to discrepancies of more than 10^-6 (in checking the total distance traveled, in checking that lane changes are non-overlapping, etc), so it's better for you to output at least 10-12 digits after the decimal point in each floating-point number.

sample input	sample output
1 100 0.5 4 5 0	19.71726232777025 0

sample input	sample output
3 100 0.5 4 5 0 2 5 0.5 0 5 0	19.052103083697858 4 2 3.6645304897691258 1 5.783185307179586 2 9.947715796948712 3 15.207963267948966