#include <bits/stdc++.h>
//---------------------------
using namespace std;
//---------------------------
#define REP(i,n) for(int i = 0; i < (n); i++)
#define P(x) cout << (x) << "\n"
#define fcout cout << fixed << setprecision(18)

#define MOD 1000000007 // 1e9+7
#define PI 3.1415926535
/*
3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679
*/
#define ll long long int // 10^18
#define INF 1000000001 // 1e9+1
#define LINF 1000000000000000001 // 1e18+1

int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
//---------------------------
bool is_prime(int n) {
    for (int i = 2; i*i <= n; ++i) {
        if (n % i == 0) return false;
    }
    return true;
}
string winner(string now, ll x,ll y) {
  if(now=="First"){
    if(is_prime(x+1)){
      if(is_prime(y+1)){
        return "Second";
      }else{
        winner("Second", x, y+1);
      }
    }else{
      winner("Second", x+1, y);
    }
  }
  if(now=="Second"){
    if(is_prime(x+1)){
      if(is_prime(y+1)){
        return "First";
      }else{
        winner("First", x, y+1);
      }
    }else{
      winner("First", x+1, y);
    }
  }
}
int main(){
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  // ifstream in("input.txt");
  // cin.rdbuf(in.rdbuf());

  ll y,x;cin>>y>>x;
  if(is_prime(y) || is_prime(x)){
    cout<<"First"<<endl;
  }else{
    cout<<winner("First", x, y)<<endl;
  }

  return 0;
}