#include <bits/stdc++.h>

using namespace std;

using ll = long long;

bool is_prime(int n) {
    if (n % 2 == 0) return false;
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0) return false;
    }
    return n != 1;
}

int solve(int n) {
    int res = 0;
    while (!is_prime(n)) {
        res++;
        n++;
    }
    if (res > 0) res--;
    return res;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int x, y;
    cin >> y >> x;
    if (is_prime(y) || is_prime(x)) {
        cout << "First" << endl;
        return 0;
    }
    int cnt = solve(y) + solve(x);
    cout << (cnt % 2 == 1 ? "First" : "Second") << endl;
    return 0;
}