#include<bits/stdc++.h>
using namespace std;
#define int long long

bool IsPrimeNumber(int n){
	if(n == 2 || n == 3)return true;
	if(n%2 == 0 || n%3 == 0|| n <= 4) return false;
	for(int i = 6; (i-1)*(i-1) <= n; i+=6)
		if(n%(i-1) == 0 || n%(i+1) == 0) return false;
	return true;
}

bool hoge(int Y, int X){
	int temp=0,x=X;
	if(!IsPrimeNumber(X)&&!IsPrimeNumber(Y)){
		while(!IsPrimeNumber(++X)&&!IsPrimeNumber(Y))	temp++;
		while(!IsPrimeNumber(++Y)&&!IsPrimeNumber(x))	temp++;
	}else if(IsPrimeNumber(X)&&!IsPrimeNumber(Y)&&!IsPrimeNumber(X+1))
		temp = hoge(Y,X+1)+1;
	else if(!IsPrimeNumber(X)&&IsPrimeNumber(Y)&&!IsPrimeNumber(Y+1))
		temp = hoge(Y+1,X)+1;
	return temp%2;
}

signed main(){
	int Y, X;
	cin>>Y>>X;
	cout<<(hoge(Y,X)?"First":"Second")<<endl;
	return 0;
}