//#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)          \
    cout << #v << ":";    \
    for (auto x : v)      \
    {                     \
        cout << x << ' '; \
    }                     \
    cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
//cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
//-std=gnu++17
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll x, y;
//素数判定(O(√n))
bool is_prime(int n)
{
    for (int i = 2; i * i <= n; i++)
    {
        if (n % i == 0)
            return false;
    }
    return n != 1;
}
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> x >> y;
    if (is_prime(x) && is_prime(x+1))
    {
        cout << "Second"
             << "\n";
        return 0;
    }
    if (is_prime(y) && is_prime(y + 1))
    {
        cout << "Second"
             << "\n";
        return 0;
    }
    ll xx = x;
    ll yy = y;
    x++;
    y++;
    while (!is_prime(x))
    {
        x++;
    }
    while (!is_prime(y))
    {
        y++;
    }
    ll res = x - xx + y - yy;
    if (res % 2==0)
        cout << "Second"
             << "\n";
    else
        cout << "First"
             << "\n";
}