#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 main(void) {
	ll x,y;
	cin>>x>>y;
	ll a = 0;
	ll b = 0;
	rep(i,x,x+1000){
		if(isPrime(i)==0)a++;
		else break;
	}
	rep(i,y,y+1000){
		if(isPrime(i)==0)b++;
		else break;
	}
	if(a==0||b==0){
		cout << "First" << endl;
	}
	else if(a+b==2){
		cout << "Second" << endl;
	}
	else{
		if((a+b)%2==0){
			cout << "Second" << endl;
		}
		else{
			cout << "First" << endl;
		}
	}
	return 0;
}