#include <bits/stdc++.h>

using namespace std;

using int64 = long long;

bool prime(int i) {
  if(i == 1) return false;
  for(int j = 2; j * j <= i; j++) {
    if(i % j == 0) return false;
  }
  return true;
}

map< pair< int, int >, int > dp;

bool check(int Y, int X) {
  if(dp.count({Y, X})) return dp[{Y, X}];
  bool f = false;
  if(!prime(Y + 1) && !prime(X)) f |= !check(Y + 1, X);
  if(!prime(Y) && !prime(X + 1)) f |= !check(Y, X + 1);
  return dp[{Y, X}] = f;
}

int main() {
  int Y, X;
  cin >> Y >> X;
  if(check(Y, X)) cout << "First" << endl;
  else cout << "Second" << endl;
}