require 'prime'

def solve(x)
    res = 0
    x += 1
    while x.prime?.!
        res += 1
        x += 1
    end
    return res
end

y, x = gets.split.map(&:to_i)
if y.prime? && x.prime?
    puts :Second
    exit
end
cnt = solve(y) + solve(x)
puts ((cnt % 2 == 1) ? :First : :Second)