#include <bits/stdc++.h>

using namespace std;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
constexpr int MOD = 1000000007;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};

template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){os << "["; for (const auto &v : vec) {os << v << ","; } os << "]"; return os; }

bool isprime(ll x) {
  if (x == 1) return false;
  bool flag = true;
  for(ll j = 2; j * j <= x; j++) {
    if (x % j == 0) {
      flag = false;
      break;
    }
  }
  return flag;
}

ll p(ll x) {
  for(ll i = x + 1; ; i++) {
    if (isprime(i)) {
      return i;
    }
  }
}

void solve() {
  ll X, Y;
  cin >> X >> Y;

  if ((isprime(X) || isprime(Y + 1)) && (isprime(X + 1) || isprime(Y))) {
    cout << "Second" << endl;
    return;
  }

  ll pX = p(X) - 1;
  ll pY = p(Y) - 1;
  ll s = (pX - X) + (pY - Y);

  if (s % 2 == 0) {
    cout << "Second" << endl;
  } else {
    cout << "First" << endl;
  }
}

int main() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);
  cout.setf(ios::fixed);
  cout.precision(16);
  solve();
  return 0;
}