import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int Y = scan.nextInt(); int X = scan.nextInt(); scan.close(); int pX = X + 1; int pY = Y + 1; while(!isPrime(pX)) { pX ++; } while(!isPrime(pY)) { pY ++; } int k = pX - X + pY - Y - 2; if(k % 2 == 0) { System.out.println("Second"); }else { System.out.println("First"); } } public static boolean isPrime(long n) { if(n < 2) return false; if(n == 2) return true; if(n % 2 == 0) return false; for(long i = 3; i <= (int)Math.sqrt(n); i += 2){ if(n % i == 0) { return false; } } return true; } }