#include <iostream>
#include <algorithm>
#include <vector>
#include <regex>
using namespace std;
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr start, itr goal){ for(auto i = start; i != goal; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
#define mod long(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl(long(n))
#define fcout cout << fixed << setprecision(10)
#define highest(x) (63 - __builtin_clzl(x))

bool is_SPRP(uint64_t n, uint64_t a) {
    uint64_t s = __builtin_ctzll(n - 1), d = (n - 1) >> s, cur = 1;
    for (uint64_t pw = d; pw; pw >>= 1) {
        if (pw & 1) cur = ((__uint128_t)cur * a) % n;
        a = ((__uint128_t)a * a) % n;
    }
    if (cur == 1) return true;
    for (; s--; cur = ((__uint128_t)cur * cur) % n)
        if (cur == n - 1) return true;
    return false;
}

bool is_prime(uint64_t x) {
    if (x <= 1) return false;
    vector<uint64_t> bases{2, 325, 9375, 28178, 450775, 9780504, 1795265022};
    if (x < 1ull << 32) bases = {2, 7, 61};
    
    for (const uint64_t base : bases)
        if (x != base && !is_SPRP(x, base)) return false;
    return true;
}

int main(){
    int X, Y;
    cin >> X >> Y;
    if(is_prime(X) || is_prime(Y)){
        cout << "Second" << endl;
        return 0;
    }
    int is_first = false;
    while(!is_prime(X)){
        X++;
        is_first ^= 1;
    }
    while(!is_prime(Y)){
        Y++;
        is_first ^= 1;
    }
    if(is_first){
        cout << "First" << endl;
    }else{
        cout << "Second" << endl;
    }
}