#include using namespace std; struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star; #define all(c) (c).begin(), (c).end() #define rall(c) (c).rbegin(), (c).rend() #define vv(type, c, m, n, i) vector> c(m, vector(n, i)) #define mat(type, c, m, n) vector> c(m, vector(n));for(auto& r:c)for(auto& i:r)cin>>i; #define rep(i,a,n) for(int i=(a), i##_len=(n); ii##_len; --i) #define each(x,y) for(auto &(x):(y)) #define var(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__); template void Scan(T& t) { cin >> t; } templatevoid Scan(First& first, Rest&...rest) { cin >> first; Scan(rest...); } #define vec(type, c, n) vector c(n);for(auto& i:c) cin>>i; #define len(x) ((int)(x).size()) #define mp make_pair #define eb emplace_back #define em emplace #define pb pop_back #define fi first #define se second #define get(a, i) get(a) #define mt make_tuple #define zero(a, b) setw(a)< vi; typedef vector vd; typedef vector vll; typedef vector vs; typedef vector vb; typedef pair pii; #define mini min_element #define maxi max_element #define sum accumulate #define chmax(a,b) if(ab)a=b template inline void print(T t){cout << t << "\n";} template inline void print(H h, T... t){cout << h << " ";print(t...);} unordered_map m; bool is_prime(ll n) { if (m.find(n) == m.end()) { if (n%2==0) return m[n] = false; for (ll i=3; i*i<=n; i+=2) if (n%i==0) return m[n] = false; } return m[n] = true; } bool f(ll y, ll x, bool ans) { int cnt = 0; if (is_prime(y + 1) || is_prime(x)) { cnt += 1; } if (is_prime(y) || is_prime(x + 1)) { cnt += 2; } if (cnt == 1) return f(y, x + 1, !ans); if (cnt == 2) return f(y + 1, x, !ans); if (cnt == 3) return !ans; bool ans1 = f(y + 1, x, !ans); bool ans2 = f(y, x + 1, !ans); if (ans1 != ans2 || ans1 == ans) { return ans; } return !ans; } bool solve() { m[1] = false; m[2] = true; var(ll, y, x); bool ans = false; if (is_prime(y) || is_prime(x)) { return ans; } return f(y, x, ans); } int main() { print(solve() ? "Second" : "First"); return 0; }