#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <iomanip>
using namespace std;
 
typedef long long ll;
 
#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=(b-1);i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

int isPrime(int n){
  long long i;
  if(n < 2LL){
    return 0LL;
  }
  else if(n == 2LL){
    return 1LL;
  }
  if(n % 2LL == 0LL){
    return 0LL;
  }
  for(i = 3LL; i * i <= n; i += 2LL){
    if(n % i == 0LL){
      return 0LL;
    }
  }
  return 1LL;
}

int f(int y, int x, int c, int h){
  if(isPrime(y)==1 || isPrime(x)==1){
    return 1-c;
  }
  if(h>15)return 1;
  
  // 0
  if(c == 0){
    int ret = 1;
    ret &= f(y+1, x, 1-c, h+1);
    ret &= f(y, x+1, 1-c, h+1);
    return ret;
  }
  // 1
  else{
    int ret = 1;
    ret |= f(y+1, x, 1-c, h+1);
    ret |= f(y, x+1, 1-c, h+1);
    return ret;
  }
}

int main(void) {
	ll y,x;
	cin>>y>>x;
	ll res = f(y,x,0,0);
	if(res == 1){
		cout << "First" << endl;
	}
	else{
		cout << "Second" << endl;
	}
	return 0;
}