CF513A.Game

Two players play a simple game. Each player is provided with a box with balls. First player's box contains exactly _n_1 balls and second player's box contains exactly _n_2 balls. In one move first player can take from 1 to _k_1 balls from his box and throw them away. Similarly, the second player can take from 1 to _k_2 balls from his box in his move. Players alternate turns and the first player starts the game. The one who can't make a move loses. Your task is to determine who wins if both players play optimally.

两名玩家进行一个简单的游戏。每位玩家都有一个装有球的盒子。第一位玩家的盒子里恰好有 $n_1$ 个球，第二位玩家的盒子里恰好有 $n_2$ 个球。在一次操作中，第一位玩家可以从自己的盒子中取出 $1$ 至 $k_1$ 个球并丢弃；类似地，第二位玩家在自己的回合中可以从自己的盒子中取出 $1$ 至 $k_2$ 个球。双方轮流行动，且由第一位玩家先手。无法进行操作的一方判负。你的任务是：在双方均采取最优策略的前提下，判断哪位玩家获胜。

The first line contains four integers _n_1, _n_2, _k_1, _k_2. All numbers in the input are from 1 to 50.

This problem doesn't have subproblems. You will get 3 points for the correct submission.

第一行包含四个整数 $n_1$、$n_2$、$k_1$、$k_2$。输入中的所有数字均在 $1$ 到 $50$ 之间。

本题没有子问题。正确提交可获得 $3$ 分。

Output "First" if the first player wins and "Second" otherwise.

如果先手玩家获胜，输出“First”；否则输出“Second”。

Consider the first sample test. Each player has a box with 2 balls. The first player draws a single ball from his box in one move and the second player can either take 1 or 2 balls from his box in one move. No matter how the first player acts, the second player can always win if he plays wisely.

考虑第一个样例测试。每位玩家都有一个装有 2 个球的盒子。第一位玩家每次从自己的盒子中抽取 1 个球；第二位玩家每次可以从自己的盒子中取走 1 个或 2 个球。无论第一位玩家如何行动，只要第二位玩家采取最优策略，就总能获胜。