#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

bool isPrime(ll n){
  if(n<=1) return false;
  if(n==2) return true;
  if(n%2==0) return false;
  ll m=sqrt(n);
  for(ll i=3; i<=m; i+=2) if(n%i==0) return false;
  return true;
}

int main(){
  ll Y, X;
  cin >> Y >> X;

  ll ret = 0;
  ll y = Y+1; while(!isPrime(y)) y++;
  ll x = X+1; while(!isPrime(x)) x++;
  y -= Y;
  x -= X;

  if(isPrime(Y) && isPrime(X)) ret = 0;
  else if(isPrime(Y+1) && isPrime(X+1)) ret = 0;
  else if(isPrime(Y)) ret = x;
  else if(isPrime(X)) ret = y;
  else ret = y+x;
  
  if(ret%2 == 0) cout << "Second" << endl;
  else cout << "First" << endl;
  
  return 0;
}