#include <bits/stdc++.h>
using namespace std;

int main()
{
	auto is_prime = [](int64_t n) {
		if (n < 2)
		{
			return false;
		}
		if (n == 2)
		{
			return true;
		}
		for (int64_t i = 2; i * i <= n; i++)
		{
			if (n % i == 0)
			{
				return false;
			}
		}
		return true;
	};
	int64_t x, y;
	cin >> x >> y;
	if ((x == 2) || (y == 2))
	{
		cout << "Second" << endl;
		return 0;
	}
	if (is_prime(x) && is_prime(y))
	{
		cout << "Second" << endl;
		return 0;
	}
	int64_t xp = x + 1, yp = y + 1;
	while (!is_prime(xp))
	{
		xp++;
	}
	while (!is_prime(yp))
	{
		yp++;
	}
	if ((xp == x) || (yp == y))
	{
		cout << "First" << endl;
		return 0;
	}
	cout << ((((xp - x) + (yp - y)) % 2) ? "First" : "Second") << endl;
	return 0;
}