#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <cassert>
using namespace std;
using i64 = int64_t;
constexpr i64 mod = 1e9 + 7;
using vi = vector<i64>;
using vvi = vector<vi>;
using ii = pair<i64, i64>;
using vii = vector<ii>;

bool is_prime(i64 a) {
    if (a == 2) return true;
    if (a % 2 == 0) return false;
    for (int i = 3; i * i <= a; i += 2) {
        if (a % i == 0) return false;
    }
    return true;
}

bool is_prime(ii a) {
    return is_prime(a.first) || is_prime(a.second);
}

int main() {
    int y, x;
    cin >> y >> x;
    if (is_prime(ii(x, y))) {
        cout << "First" << endl;
        return 0;
    }
    if (is_prime(ii(x + 1, y)) && is_prime(ii(x, y + 1))) {
        cout << "Second" << endl;
        return 0;
    }
    if ((x + y) % 2 == 0) {
        cout << "First" << endl;
    } else {
        cout << "Second" << endl;
    }
}