#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using P = pair; constexpr int INF = 1001001001; constexpr int mod = 1000000007; // constexpr int mod = 998244353; template inline bool chmax(T& x, T y){ if(x < y){ x = y; return true; } return false; } template inline bool chmin(T& x, T y){ if(x > y){ x = y; return true; } return false; } bool is_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(){ ios::sync_with_stdio(false); cin.tie(nullptr); ll X, Y; cin >> X >> Y; if(is_prime(X) && is_prime(Y)){ cout << "Second\n"; return 0; } if(is_prime(X) && is_prime(X + 1)){ cout << "Second\n"; return 0; } if(is_prime(Y) && is_prime(Y + 1)){ cout << "Second\n"; return 0; } ll Z = X + 1, W = Y + 1; while(!is_prime(Z)) ++Z; while(!is_prime(W)) ++W; ll dist = (Z - X) + (W - Y); if(dist % 2 == 1) cout << "First\n"; else cout << "Second\n"; return 0; }