#include <bits/stdc++.h>
using ll = long long;
using namespace std;

vector<int> list_primes(int n) {
    vector<bool> is_prime(n, true);
    is_prime[0] = is_prime[1] = false;
    for (int i = 2; i *(ll) i < n; ++ i)
        if (is_prime[i])
            for (int k = 2 * i; k < n; k += i)
                is_prime[k] = false;
    vector<int> primes;
    for (int i = 2; i < n; ++ i)
        if (is_prime[i])
            primes.push_back(i);
    return primes;
}
bool is_prime(ll n, vector<int> const & primes) {
    if (n == 1) return false;
    for (int p : primes) {
        if (n < (ll)p * p) break;
        if (n % p == 0) return false;
    }
    return true;
}

bool solve(int y, int x) {
    const auto primes = list_primes(1e5);
    if (is_prime(y, primes) and is_prime(x, primes)) return false;
    int h = 0;
    int w = 0;
    while (not is_prime(y + h + 1, primes)) ++ h;
    while (not is_prime(x + w + 1, primes)) ++ w;
    return (h % 2) ^ (w % 2);
}

int main() {
    int y, x; cin >> y >> x;
    cout << (solve(y, x) ? "First" : "Second") << endl;
    return 0;
}