#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

ll power(ll x, ll n, ll p = 1000000007) {
	if (n == 0) {
		return 1;
	}
	if (n % 2 == 0) {
		return power(x * x % p, n / 2, p) % p;
	}
	else {
		return x * power(x, n - 1, p) % p;
	}
}

bool IsPrime(int num)
{
	if (num < 2) return false;
	else if (num == 2) return true;
	else if (num % 2 == 0) return false; 

	double sqrtNum = sqrt(num);
	for (int i = 3; i <= sqrtNum; i += 2)
	{
		if (num % i == 0)
		{
			return false;
		}
	}
	return true;
}
map<pair<ll, ll>, bool> dp;

bool dfs(ll y, ll x) {
	if (y >= 2 && power(MAX, y - 2, y) == 1) {
		if (IsPrime(y)) return true;
	}
	if (x >= 2 && power(MAX, x - 2, x) == 1) {
		if (IsPrime(x)) return true;
	}
	if (dp.find({ y,x }) != dp.end()) return dp[{y, x}];
	bool flag = false;
	flag |= !dfs(y + 1, x);
	if (flag) return flag;
	flag |= !dfs(y, x + 1);
	return flag;
}
int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	ll Y, X; scanf("%lld %lld", &Y, &X);
	bool flag;
	if (IsPrime(Y) && IsPrime(X)) {
		puts("Second");
		return 0;
	}
	else if (IsPrime(Y)) {
		flag = !dfs(Y + 1, X);
	}
	else if (IsPrime(X)) {
		flag = !dfs(Y, X + 1);
	}
	else {
		flag = dfs(Y, X);
	}
	if (flag) puts("First");
	else puts("Second");
	return 0;
}