#include<iomanip>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;
typedef pair<ll, ll> mp;
ll mod = 1e9+7;
ll inf = 1e18;

//AC

bool prime(ll x){
	if(x==1)return false;
	for(ll i=2;i*i<=x;i++){
		if(x%i==0)return false;
	}
	return true;
}

int main(void){
	ll y,x,dx=0,dy=0;
	cin>>y>>x;
	if(prime(x)){
		if(prime(y)){
			//つみ
			cout<<"Second"<<endl;
			return 0;
		}else{
			if(!prime(x+1)){
				dx++;
			}else{
				cout<<"Second"<<endl;
				return 0;
			}
		}
	}else{
		if(prime(y)){
			if(!prime(y+1)){
				dy++;
			}else{
				cout<<"Second"<<endl;
				return 0;
			}
		}
	}
	while(!prime(x+dx+1))dx++;
	while(!prime(y+dy+1))dy++;
	if((dx+dy)%2==0){
		cout<<"Second"<<endl;
	}else{
		cout<<"First"<<endl;
	}
	return 0;
}