#include <bits/stdc++.h>

using namespace std;
using ll = long long;

void init();
void solve();

#define rep(i, a) for (int i = 0; i < (int) (a); i++)
#define reps(i, a, b) for (int i = (int) (a); i < (int) (b); i++)
#define rrep(i, a) for (int i = (int) a-1; i >= 0; i--)
#define rreps(i, a, b) for (int i = (int) (a)-1; i >= (int) (b); i--)
#define MP(a, b) make_pair((a), (b))
#define PB(a) push_back((a))
#define all(v) (v).begin(), (v).end()
#define PRINT(f) if((f)){cout << (TRUE__) << endl;}else{cout << FALSE__ << endl;}
#define TRUE__ "Yes"
#define FALSE__ "No"
#define PERM(v) next_permutation(all(v))
#define UNIQUE(v) sort(all(v));(v).erase(unique(all(v)), v.end())
#define CIN(type, x) type x;cin >> x

#ifdef LOCAL
#define lcout(a) cout << a;
#define lcoutln(a) cout << a << endl;
#define lcerr(a) cerr << a;
#define lcerrln(a) cerr << a << endl;
#else
#define lcout(a) 
#define lcoutln(a) 
#define lcerr(a) 
#define lcerrln(a) 
#endif
#define MOD 1000000007

ll R, C;
vector<ll> sosu;

signed main()
{
	init();
	solve();
}

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

void init()
{
	cin >> R >> C;
}

ll ne(ll x)
{
	x++;
	while (!isprime(x)) {
		x+=1;
	}
	return x;
}

void solve()
{
	ll cnt = 0;
	if (R == 2 || C == 2) {
		cout << "Second" << endl;
		return;
	}
	if (isprime(R)) {
		if (isprime(C)) {
			cout << "Second" << endl;
			return;
		}
		R++;
		cnt++;
	} else if (isprime(C)) {
		C++;
		cnt++;
	}
	cnt += ne(R) - R;
	cnt += ne(C) - C;
	if (cnt % 2 == 0) {
		cout << "Second" << endl;
	} else {
		cout << "First" << endl;
	}
}