#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i=a; i<n; i++)
#define RREP(i, a, n) for(ll i=n-1; i>=a; i--)
typedef long long ll;
const ll mod =1e9+7;
const ll inf =1e18;
using namespace std;

ll y, x;
bool IsPrime(ll num)
{
    if (num < 2) return false;
    for (ll i = 2; i*i <= num; i++) {
        if (num % i == 0) return false;
    }
    return true;
}
int main() {
    cin>>y>>x;

    ll ans=0;

    while(!IsPrime(y)){
        y++;
        if(IsPrime(y)) break;
        ans++;
    }
    while(!IsPrime(x)){
        x++;
        if(IsPrime(x)) break;
        ans++;
    }

    if(ans%2==0) cout<<"Second"<<endl;
    else cout<<"First"<<endl;
    return 0;
}