#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(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>>y>>x;

    ll ans=0;
    if(IsPrime(y) || IsPrime(x)){
        cout<<"First"<<endl;
        return 0;
    }

    while(!IsPrime(y)){
        ans++;
        y++;
    }
    while(!IsPrime(x)){
        ans++;
        x++;
    }
    
    if(ans<=2) cout<<"Second"<<endl;
    else if((ans-2)%2==0) cout<<"Second"<<endl;
    else cout<<"First"<<endl;
    return 0;
}