The two machines scheduling is the process of assigning a group of tasks to two machines. Given n tasks, each task i associates with t_1i and t_2i the processing time of the task on machine 1 and machine 2, respectively. Besides, there are values p_1i and p_2i that denote the preference of task i assigning to machine 1 and machine 2. Note that machine 1 is capable to handle at most Q₁ tasks while the capacity of machine 2 is Q₂ (Q₁+Q₂>=n). Your job is to determine an optimal assignment of tasks to two machines such that the total processing time is minimal. If there exist a tie, the total preference should be maximal.

       The input file may consist of multiple test cases.

       For each test case, the first line is the number of tasks n, followed by the capacities of two machines Q₁ and Q₂. The next n lines each line i (1<=i<=n) contains four integers t_1i, t_2i, p_1i, p_2i, which are defined by the problem description. n<=100,000 and each of the integer t_1i, t_2i, p_1i, p_2i is no greater than 100.

       For each test case, output two integers T and P. T corresponds to the minimal processing time of all tasks on two machines and P corresponds to the maximal preference.

3 2 2
1 1 1 1
1 2 1 2
2 1 2 1
3 2 2
1 1 1 2
1 2 1 2
2 1 2 1

3 3
3 4