#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;



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;
}

int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	ll Y, X; scanf("%lld %lld", &Y, &X);
	if (Y == 2 || X == 2) {
		puts("Second");
		return 0;
	}
	if (IsPrime(X) && IsPrime(Y)) {
		puts("Second");
		return 0;
	}

	ll dx, dy;
	for (ll i = X + 1;; i++) {
		if (IsPrime(i)) {
			dx = i - X;
			break;
		}
	}
	for (ll i = Y + 1;; i++) {
		if (IsPrime(i)) {
			dy = i - Y;
			break;
		}
	}
	dx--;
	dy--;
	ll len = dx + dy;
	if (len & 1) {
		puts("First");
	}
	else {
		puts("Second");
	}
	return 0;
}