#pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define VPII vector<PII>
#define VPLL vector<PLL>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
#pragma endregion
//-------------------
const ll MX = 1000;

bool isprime(ll x) {
    if(x == 1) return false;
    if(x == 2) return true;
    if(x%2==0) return false;
    for(ll i=3; i*i <= x; i+=2) {
        if(x%i==0) return false;
    }
    return true;
}

ll nextPrime(ll x) {
    x++;
    while(!isprime(x)) x++;
    return x;
}

int main(){
    cin.tie(0); ios::sync_with_stdio(false); //cout << fixed << setprecision(15);
    ll x,y; cin >> x >> y;

    ll x_mn = nextPrime(x);
    ll y_mn = nextPrime(y);

    ll diff = x_mn - x + y_mn - y;
    // cout << y_mn;
    if(isprime(x) or isprime(y)) {
        cout << "First" << endl;
        return 0;
    }
    if(diff%2==1) {
        cout << "First" << endl;
    } else cout << "Second" << endl;
    return 0;
}