import java.util.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		new Main().run();
	}

	void run() {
		Scanner sc = new Scanner(System.in);
		X = sc.nextLong();
		Y = sc.nextLong();
		System.out.println(dfs(0, 0, 0) == 1 ? "First" : "Second");
	}

	long X, Y;

	// memo[i][j]=1 勝ち
	// memo[i][j]=0 負け

	int dfs(int dx, int dy, int cnt) {
		if (cnt == 0 && !(dx == 0 && dy == 0))
			cnt = 1;
		if (memo[cnt][dx][dy] != -1)
			return memo[cnt][dx][dy];
		if (cnt != 0 && isPrime(X + dx) || isPrime(Y + dy))
			return memo[cnt][dx][dy] = 1;
		if (dfs(dx + 1, dy, cnt) == 0 || dfs(dx, dy + 1, cnt) == 0) {
			return memo[cnt][dx][dy] = 1;
		} else {
			return memo[cnt][dx][dy] = 0;
		}
	}

	int[][][] memo = new int[2][1000][1000];
	{
		for (int i = 0; i < memo.length; ++i)
			for (int j = 0; j < memo[i].length; ++j)
				for (int k = 0; k < memo[i][j].length; ++k)
					memo[i][j][k] = -1;
	}

	boolean isPrime(long a) {
		if (a == 1)
			return false;
		for (long i = 2; i * i <= a; ++i) {
			if (a % i == 0)
				return false;
		}
		return true;
	}

	void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}
}