rubles = int(input())
gp1 = list(map(int, input().split(' ')))
gp2 = list(map(int, input().split(' ')))
gp3 = list(map(int, input().split(' ')))
gp4 = list(map(int, input().split(' ')))
anser1 = ''
anser2 = ''
anser3 = ''
anser4 = ''
if min(gp1[0:2]) + min(gp1[2:5]) <= rubles:
anser1 = '1 {} {}'.format(min(gp1[0:2]), rubles-min(gp1[0:2]))
print(anser1)
elif min(gp2[0:2]) + min(gp2[2:5]) <= rubles:
anser2 = '2 {} {}'.format(min(gp2[0:2]), rubles-min(gp2[0:2]))
print(anser2)
elif min(gp3[0:2]) + min(gp3[2:5]) <= rubles:
anser3 = '3 {} {}'.format(min(gp3[0:2]), rubles-min(gp3[0:2]))
print(anser3)
elif min(gp4[0:2]) + min(gp4[2:5]) <= rubles:
anser4 = '4 {} {}'.format(min(gp4[0:2]), rubles-min(gp4[0:2]))
print(anser4)
else:
print('-1')
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |
XOREQN Xor Equation | MAKEPAL Weird Palindrome Making |
HILLSEQ Hill Sequence | MAXBRIDGE Maximise the bridges |
WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |
1002. Find Common Characters | 1602A - Two Subsequences |
1555A - PizzaForces | 1607B - Odd Grasshopper |
1084A - The Fair Nut and Elevator | 1440B - Sum of Medians |
1032A - Kitchen Utensils | 1501B - Napoleon Cake |
1584B - Coloring Rectangles | 1562B - Scenes From a Memory |
1521A - Nastia and Nearly Good Numbers | 208. Implement Trie |