#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<fstream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

template < typename T >
void vprint(T &V){
	for(auto v : V){
    	cout << v << " ";
	}
	cout << endl;
}

bool isPrime(ll n){
    if (n < 2) return false;
    else if (n == 2) return true;
    else if (n % 2 == 0) return false;

    double sqrtNum = sqrt(n);
    for (ll i=3; i<=sqrtNum; i+=2){
        if (n%i == 0){
            return false;
        }
    }
    return true;
}

ll next_prime(ll a){
    while(true){
        a++;
        if(isPrime(a)){
            return a;
        }
    }
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll Y, X;
    cin >> Y >> X;

    bool is_y_prime = isPrime(Y);
    bool is_x_prime = isPrime(X);

    if(is_y_prime && is_x_prime){
        p("Second");
        return 0;
    }

    if(X==2 || Y==2){
        p("Second");
        return 0;
    }

    ll nx = next_prime(X);
    ll ny = next_prime(Y);

    ll dx = nx - X - 1;
    ll dy = ny - Y - 1;

    ll sum = dx + dy;
    if(sum%2==0){
        p("Second");
    }else{
        p("First");
    }
    
    return 0;
}