MMMAGIC5

Mickey Mouse and Donald Duck love magic. They specialize with card tricks. Mickey invented a new trick and they are going to surprise the world. They've contracted series of shows on whole the globe, worth many million of dollars $$. The first show is coming up but unfortunately Mickey lost secret of the trick. He remembers only trick description, but it's not enough to satisfy the contract conditions. Help them!

Trick description

Mickey has n cards with values 1, 2, ..., n. He invites a spectator from the audience, Donald is outside the stage and see nothing on the stage. The spectator chooses randomly k cards from the pack and discard the remaining n-k cards. Mickey chooses one card from this k cards, shows it to everyone (except Donald) and hides it to the spectator's pocket. Next Mickey leaves the remaining k-1 cards in some order on the table. Donald is coming back. He is the only person, who don't know, what is the number in the hiden card. He can see only k-1 cards on the table. Donald thinks for a while, the drum rumbles, at the beginning very silent, then later and later, everyone is waiting, the drum stops, a few seconds of deep silence and... Donald says the number on the hidden card. It's correct, applause! How did he discover the number? It's magic!

Help request

Mickey and Donald know, that's not magic only smart math manipulations. They asked You to help them. You have to write computer program, that can help them with the trick. The program should be able to do two things: help Mickey to select one card from given k cards and describe order of remaining k-1 cards on the table, then help Donald to guess the hidden card value basing only on k-1 cards left by Mickey on the table. You can use any strategy that You want, but remember - Donald needs to guess the number during the show, because the huge profit $$ depends on it.

Input

All integers in the same line are single-space separated (the same concerns problem output).

Values n, k are constant. In this problem n=124 and k=5. There are also problems with different values: MMMAGIC3, MMMAGIC4, MMMAGIC6

The first line of input contains two integers M, D, where M is the number of test cases in which Mickey needs help, D is the number of test cases in which Donald needs help (M+D < 10⁶).

Every of next M lines contains k distinct integers from range [1, n] - the values on cards given to Mickey. The values are sorted in ascending order.

Every of next D lines contains k-1 distinct integers from range [1, n] - the cards left to Donald on the table. The order is the same, as on the table, from left to right.

Output

For each Mickey's query write a line with k-1 integers - the values on the cards, that Mickey have to leave on the table, from left to right.

For each Donald's query write a line with one integer - the value of hidden card or (if in Your strategy such situation is impossible) any of remaining values.

Example

Input 1
3 0
1 2 3 4 5
2 4 6 40 80
4 7 8 72 123

Output 1
4 3 2 1
4 6 80 2
4 7 123 8

Input 2
0 3
4 3 2 1
4 6 80 2
4 7 123 8

Output 2
5
40
72

Explanation

The example above don't show any concrete strategy. It just shows, that strategy must be coherent (when Mickey for given set of cards 1 2 3 4 5 leave on the table 4 3 2 1, then Donald for given cards 4 3 2 1 should answer with the number 5).

Generally You can implement your own strategy satisfying the conditions below:

• for Mickey's query "a₁ a₂ ... a_k" You should reply "b₁ b₂ ... b_k-1", such that {b₁, b₂, ..., b_k-1} is subset of {a₁, a₂, ..., a_k}
• for Donald's query "b₁ b₂ ... b_k-1" reply the number c, such that {b₁, b₂, ..., b_k-1, c} = {a₁, a₂, ..., a_k}

Note

The problem appeared in MWPZ 2007 contest in Poland, with different story (in original problem there was Polish characters Jacek and Placek). The main page of contest is http://mwpz.poznan.pl