#include <iostream>

using namespace std;

bool checkPrime(long long k) {
    if (k==1) return false;
    for (long long i = 2; i*i <= k; i++) {
        if (k % i == 0) return false;
    }
    return true;
}
int main() {
    long long x, y, xi, yi;
    cin >> y >> x;

    xi = yi = 1;
    if (!checkPrime(y)) {
        while (1) {
            if (checkPrime(x + xi)) {
                break;
            } else {
                xi++;
            }
        }
    }
    if (!checkPrime(x)) {
        while (1) {
            if (checkPrime(y + yi)) {
                break;
            } else {
                yi++;
            }
        }
    }
    if ((xi + yi) % 2 == 0) {
        cout << "Second" << endl;
    } else {
        cout << "First" << endl;
    }
    return 0;
}