#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

bool isPrime(int n) {
    if (n == 1)RT false;
    for (int i = 2; i*i <= n; ++i) {
        if (n%i == 0)RT false;
    }
    RT true;
}

map<pii, bool> mem;
bool f(int x, int y, bool fst) {
    if (mem.count(mp(x, y)))RT mem[mp(x, y)];

    bool &re = mem[mp(x, y)];

    if (!fst && (isPrime(x) || isPrime(y)))RT re = true;

    if (!f(x + 1, y, false) || !f(x, y + 1, false))RT re = true;
    RT re = false;
}

void solve() {
    int x, y;
    cin >> x >> y;
    cout << (f(x, y, true) ? "First" : "Second") << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    solve();
    return 0;
}