Escape from Asgard

Thor and the other residents of Asgard are escaping on the Grandmaster's ship. But first they have to board it.

The ship has two decks. The upper deck has $A$ seats and the lower deck has $B$ seats. The entrance is on the upper deck. Thor directs the boarding. It is not simple, though. The residents form groups of friends, and each group wants to sit entirely on one deck so they can talk easily. Thor is in group 1. Since Thor directs the boarding, his group boards last, and to avoid delaying the departure, they want to sit on the upper deck.

Determine whether the groups can be split between the two decks so that everyone gets a seat. If so, determine whether the split can also place group 1, Thor's group, on the upper deck.

The first line contains integers $n$, $A$, and $B$: the number of groups, the number of seats on the upper deck, and the number of seats on the lower deck ($1 \le n \le 100$, $1 \le A, B \le 10^5$). The next line contains $n$ integers $a_i$, the number of people in each group ($1 \le a_i \le 1000$).

If the groups cannot be split so that all people get seats, print $-1$. Otherwise, if group 1 can be on the upper deck, print $1$; if not, print $2$. The next two lines describe the upper deck, then the lower deck. Each line starts with the number of groups on that deck, followed by the group numbers. Groups are numbered from 1 in input order.