#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll =  long long ;
using P = pair<ll,ll> ;
const int INF = 1e9;
const int MOD = 1000000007;

bool is_Prime(int x){
    if(x==1) return false;
    bool res = true;
    for(int i=2;i*i<=x;i++){
        if(x%i ==0){
            res= false;
            break;
        }
    }
    return res;
}

int up_prime(int x){
    while(1){
        if(is_Prime(x)) return x;
        ++x;
    }
}

int main(){
    int y,x;
    cin >> y >> x;
    bool y_prime = is_Prime(y);
    bool x_prime = is_Prime(x);
    if(x_prime && y_prime){
        cout << "Second" << endl;
        return 0;
    }else{
        int a = up_prime(x+1);
        int b = up_prime(y+1);
        bool fi = ((a-1-(x+x_prime)+(b-1-(y+y_prime)))%2==(!x_prime&&!y_prime))&&(a-1-(x+x_prime)>=0)&&(b-1-(y+y_prime)>=0) ;
        cout << (fi ? "First" : "Second") << endl;
    }
    return 0;
}