require 'prime' LIM = 10 ** 1333 def solve(x) res = 0 while x.prime?.! && x <= LIM res += 1 x += 1 end if res > 0 res -= 1 end return res end y, x = gets.split.map(&:to_i) if x.prime? || y.prime? puts :First exit end cnt = solve(y) + solve(x) puts ((cnt % 2 == 1) ? :First : :Second)