#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
 
using namespace std;
typedef long long ll;
 
 
typedef pair<ll,ll> P;
long long int INF = 1e18;
double Pi = 3.141592653589;
long long int mod = 1000000007;
// memset(a,0,sizeof(a)); →全部０にする
 
vector<ll> G[100005];
vector<P> tree[100010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll>> pqls;
priority_queue <P,vector<P>,greater<P>> pqps;
//small priority queue
//top pop

int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
//↓,→,↑,←
 
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<x;
#define re(i,a,b) for(i=a;i<=b;i++);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
 
ll rui(ll abc,ll bed){
	//aのb乗を計算する
	if(bed==0){return 1;}
	else{
		ll ced = rui(abc,bed/2);
		ced *= ced;
		ced %= mod;
		if(bed%2==1){ced*=abc; ced%=mod;}
		return ced;
	}
} 
ll i,j,k,ii,jj;
ll n,m,num;
ll ans;
ll a,b,c,d,e,f,g,h,w;
 
ll x[800005],y[800005],z[900005];
ll dp[8005][8005];

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

ll solve(ll a,ll b){
	//pe(a);p(b);
	if(dp[a-n][b-m]>=1){
		return dp[a-n][b-m];
	}else if((prime(a) || prime(b)) && !(n==a && m==b)){
		dp[a-n][b-m] = 1;
		return 1;
	}else if(solve(a+1,b)==1 && solve(a,b+1)==1){
		dp[a-n][b-m] = 2;
		return 2;
	}else{
		dp[a-n][b-m] = 1;
		return 1;
	}
}
		
		


int main(){	
	cin>>n>>m;
	solve(n,m);
	if(solve(n,m)==1){
		p("First");
	}else{
		p("Second");
	}
	return 0;
}