#include #define rep(i,a,b) for(int i=a;i=b;i--) #define fore(i,a) for(auto &i:a) #define all(x) (x).begin(),(x).end() #pragma GCC optimize ("-O3") using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); } typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60; templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b(x >> 32); } inline unsigned int lodword(unsigned long long x) { return static_cast(x & 0xFFFFFFFF); } inline unsigned long long __builtin_ctzll(unsigned long long x) { return lodword(x) ? __builtin_ctz(lodword(x)) : __builtin_ctz(hidword(x)) + 32; } inline unsigned long long __builtin_clzll(unsigned long long x) { return hidword(x) ? __builtin_clz(hidword(x)) : __builtin_clz(lodword(x)) + 32; } inline unsigned long long __builtin_ffsll(unsigned long long x) { return lodword(x) ? __builtin_ffs(lodword(x)) : hidword(x) ? __builtin_ffs(hidword(x)) + 32 : 0; } inline unsigned long long __builtin_popcountll(unsigned long long x) { return __builtin_popcount(lodword(x)) + __builtin_popcount(hidword(x)); } #endif // _WIN32 #pragma pop_macro("long") #endif // _MSC_VER typedef long long ll; typedef __int128 int128_t; //typedef ll int128_t; int128_t powmod(int128_t x, int128_t y, int128_t p) { // O(log y) assert(0 <= x and x < p); assert(0 <= y); int128_t z = 1; for (int128_t i = 1; i <= y; i <<= 1) { if (y & i) z = z * x % p; x = x * x % p; } return z; } int K = 10; int getrand(int l, int r) { // [l, r] static uint32_t y = time(NULL); y ^= (y << 13); y ^= (y >> 17); y ^= (y << 5); return y % (r - l + 1) + l; } ll getrandll(ll l, ll r) { // [l,r] ll a = getrand(0, 999999999); ll b = getrand(0, 999999999); ll x = a * 1000000000LL + b; assert(0 <= x); return x % (r - l + 1) + l; } bool isprime(ll v, int loop = 50) { ll d = v - 1; int s = 0, i, j; if (v <= 1) return false; if (v == 2) return true; if (v % 2 == 0) return false; while (d % 2 == 0) d /= 2, s++; rep(i, 0, loop) { ll a = getrandll(1, v - 1); ll r = powmod(a, d, v); if (r == 1 || r == v - 1) continue; int j; for (j = 0; j < s; j++) { r = powmod(r, 2, v); if (r == v - 1) break; } if (j == s) return false; } return true; } /*---------------------------------------------------------------------------------------------------             ∧_∧       ∧_∧  (´<_` )  Welcome to My Coding Space!      ( ´_ゝ`) /  ⌒i     /   \    | |     /   / ̄ ̄ ̄ ̄/  |   __(__ニつ/  _/ .| .|____      \/____/ (u ⊃ ---------------------------------------------------------------------------------------------------*/ ll Y, X; //--------------------------------------------------------------------------------------------------- #define first "First" #define second "Second" string solve() { if (isprime(X) and isprime(Y)) return second; if (X == 2 or Y == 2) return second; int rev = 0; if (isprime(X)) rev = 1, X++; else if (isprime(Y)) rev = 1, Y++; ll x = X, y = Y; while (!isprime(x)) x++; while (!isprime(y)) y++; ll d = (y - Y - 1) + (x - X - 1); if (d % 2 == 0) { if (rev == 0) return first; else return second; } if (rev == 0) return second; else return first; } //--------------------------------------------------------------------------------------------------- void _main() { cin >> Y >> X; cout << solve() << endl; }