Two piles#2485
Two players are engaged in a game involving two piles of stones, initially containing and stones, respectively. Each player has a specific set of moves they can make: the first player can choose from a_1, a_2, \ldots, a_k, while the second player can choose from b_1, b_2, \ldots, b_l. On their turn, the first player can remove any number of stones equal to one of their allowed moves a_i from either pile. Similarly, the second player can remove stones according to their allowed moves b_j. The players alternate turns, and the player who cannot make a move loses the game. Your task is to determine which player will win.
The first line contains the integers and .
The second line has the format k\ a_1\ a_2\ \ldots\ a_k.
The third line has the format l\ b_1\ b_2\ \ldots\ b_l.
The following constraints are guaranteed: 1 \leq A, B \leq 1000, 1 \leq k, l \leq 10, 1 \leq a_i, b_j \leq 1000.
Output First if the first player is guaranteed to win, otherwise output Second.
Example 1