codeforce Dima and Guards

Dima and Guards

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Nothing has changed since the last round. Dima and Inna still love each other and want to be together. They've made a deal with Seryozha and now they need to make a deal with the dorm guards...

There are four guardposts in Dima's dorm. Each post contains two guards (in Russia they are usually elderly women). You can bribe a guard by a chocolate bar or a box of juice. For each guard you know the minimum price of the chocolate bar she can accept as a gift and the minimum price of the box of juice she can accept as a gift. If a chocolate bar for some guard costs less than the minimum chocolate bar price for this guard is, or if a box of juice for some guard costs less than the minimum box of juice price for this guard is, then the guard doesn't accept such a gift.

In order to pass through a guardpost, one needs to bribe both guards.

The shop has an unlimited amount of juice and chocolate of any price starting with 1. Dima wants to choose some guardpost, buy one gift for each guard from the guardpost and spend exactly n rubles on it.

Help him choose a post through which he can safely sneak Inna or otherwise say that this is impossible. Mind you, Inna would be very sorry to hear that!

Input

The first line of the input contains integer n (1 ≤ n ≤ 105) — the money Dima wants to spend. Then follow four lines describing the guardposts. Each line contains four integers a, b, c, d (1 ≤ a, b, c, d ≤ 105) — the minimum price of the chocolate and the minimum price of the juice for the first guard and the minimum price of the chocolate and the minimum price of the juice for the second guard, correspondingly.

Output

In a single line of the output print three space-separated integers: the number of the guardpost, the cost of the first present and the cost of the second present. If there is no guardpost Dima can sneak Inna through at such conditions, print -1 in a single line.

The guardposts are numbered from 1 to 4 according to the order given in the input.

If there are multiple solutions, you can print any of them.

Sample test(s)

input

105 6 5 66 6 7 75 8 6 69 9 9 9

output

1 5 5

input

106 6 6 67 7 7 74 4 4 48 8 8 8

output

3 4 6

input

53 3 3 33 3 3 33 3 3 33 3 3 3

output

-1

Note

Explanation of the first example.

The only way to spend 10 rubles to buy the gifts that won't be less than the minimum prices is to buy two 5 ruble chocolates to both guards from the first guardpost.

Explanation of the second example.

Dima needs 12 rubles for the first guardpost, 14 for the second one, 16 for the fourth one. So the only guardpost we can sneak through is the third one. So, Dima can buy 4 ruble chocolate for the first guard and 6 ruble juice of the second guard.

虽然说是英文题目，但读起来却一点也不觉得难，老外说的英语就是比咋们说的地道，呵呵。

题目意思很好理解，就是要我们判定他们两个人是否能够恰好花n卢布的钱，要么买巧克力，要么买果汁去贿赂四个方向的守卫，给出的四行是巧克力和果汁的价格。问在这四个方向里面，是否能够找到两个物品在刚好等于n卢布的情况下，买下了，去贿赂守卫。

顺便说一下，突然间发现codeforce的代码好短就可以解决一道题啊。

#include<stdio.h>
int min(int a, int b)
{
    return a<b? a: b;
}
int n;
int A[5][5];


int main()
{
    scanf("%d", &n);
    int i, j;
    int a,b,c,d;
    for(i=0; i<4; ++i)
        for(j=0; j<4; ++j)
            scanf("%d", &A[i][j]);
    for(i=0; i<4; ++i)
        if(min(A[i][0], A[i][1])+min(A[i][2], A[i][3])<=n)
        {
            printf("%d ",i+1);
            printf("%d ",min(A[i][0], A[i][1]));
            printf("%d", n-min(A[i][0], A[i][1]));
            return 0;
        }
    printf("-1");
    return 0;
}