Two piles
Two players are engaged in a game involving two piles of stones, initially containing A and B stones, respectively. Each player has a specific set of moves they can make: the first player can choose from a_1, a_2, ..., a_k, while the second player can choose from b_1, b_2, ..., 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.
Input
The first line contains the integers A and B. The second line provides the integer k followed by k integers a_i. The third line contains the integer l followed by l integers b_1, b_2, ..., b_l. The following constraints are guaranteed: 1 ≤ A, B ≤ 1000, 1 ≤ k, l ≤ 10, 1 ≤ a_i, b_j ≤ 1000.
Output
Output First if the first player is guaranteed to win, otherwise output Second.