#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)
#define MAX LONG_LONG_MAX

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int Y, X;

bool is_prime(int n) {
    if (n == 1) return false;
    if (n == 2) return true;
    FOR(i, 2, sqrt(n)+1) {
        if (n % i == 0) return false;
    }
    return true;
}

int next_prime(int n) {
    FOR(i, n+1, n+1000000000) {
        if (is_prime(i)) {
            return i;
        }
    }
    return -1;
}

signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin >> Y >> X;
    
    if (is_prime(Y) && is_prime(X)) {
        cout << "Second" << endl;
        return 0;
    }
    
    int nextY = next_prime(Y);
    int nextX = next_prime(X);
    
    int diffY = nextY - Y;
    int diffX = nextX - X;
    
    if ((diffY == 1 && is_prime(Y)) || (diffX == 1 && is_prime(X))) {
        cout << "Second" << endl;
        return 0;
    }
    
    if ((diffY + diffX) % 2 == 1) {
        cout << "First" << endl;
    } else {
        cout << "Second" << endl;
    }
    
    return 0;
}