Unfair Game#8797
Maxim and Yurko are playing a game. At the beginning, each player is given an array of numbers. Each player knows both their own array and their opponent's array. There is a pile with stones.
Players take turns. On each turn, a player can remove stones from the pile, where is any number from the array assigned to that player. The player who cannot make a move loses the game.
Determine which player will win if both play optimally.
The first line contains three integers: 0 \leq n \leq 1000 (the size of Maxim's array), 0 \leq m \leq 1000 (the size of Yurko's array), and 0 \leq s \leq 1000 (the initial number of stones in the pile).
The second line contains integers, representing Maxim's array.
The third line contains integers, representing Yurko's array.
The fourth line contains a single character indicating which player moves first: "M" for Maxim or "Y" for Yurko.
Output a single character indicating the winner: "M" for Maxim or "Y" for Yurko.
Example 1