In a country, there is a number of cities connected by unidirectional roads. Due to insufficient budget, some roads are covered with pot-holes, so certain cars cannot use certain roads. Thus each road has the height number associated with it — that is the minimal height of the bottom of a car that can drive through that road. On the other hand, some roads are private, and one should pay for using them. Luckily, the amount to be paid is standartized and equals one standard unit. Finally, for each road, the time required to drive through it is known.

Given that you have to drive from city s to city f using no more than t minutes of time, no more than b standard units, find the minimal height of the bottom of the car which makes it possible.

The first line of the input contains the number of cities n (1 ≤ n ≤ 100), the number of roads m (1 ≤ m ≤ 10⁴), and the numbers of starting and ending cities s and f (1 ≤ s, f ≤ n). The second line contains numbers b (0 ≤ b ≤ 10⁶) and t (0 ≤ t ≤ 10⁶).

Each of the next m lines has the form u_i v_i c_i t_i h_i. Here, u_i is the starting city for i-th road, v_i is the ending city, c_i is 1 if it is a private road and 0 otherwise, t_i is the time required to drive through that road, and h_i is the height of the car required to pass (1 ≤ u_i, v_i ≤ n; 0 ≤ t_i ≤ 10⁴; 0 ≤ h_i ≤ 10⁶). All the numbers in the input are integers.

If there is no way to drive from s to f under given restrictions, output "−1". Otherwise write on the first line the minimal height of the car; the second line should contain the number of roads used to travel from s to f; and the third line must be filled by the numbers of the roads you used in the order of usage. Roads are numbered from 1 to m; the order is the same as in input.