import std; bool isPrime(int n) { if (n == 2) return true; if (n % 2 == 0) return false; for (int i = 3; i * i <= n; i += 2) { if (n % i == 0) return false; } return true; } int nextPrimeDistance(int n) { if (n == 1 || n == 2) return 0; if (n % 2 == 0) return isPrime(n+1) ? 0 : 2; return 1; } void calc(int y, int x) { if (isPrime(y) && isPrime(x)) { writeln("Second"); return; } int d = nextPrimeDistance(y) + nextPrimeDistance(x); if (d % 2 == 1) writeln("First"); else writeln("Second"); } void main() { int y, x; scan(y, x); calc(y, x); } void scan(T...)(ref T a) { string[] ss = readln.split; foreach (i, t; T) a[i] = ss[i].to!t; } T read(T)() { return readln.chomp.to!T; } T[] reads(T)() { return readln.split.to!(T[]); } alias readint = read!int; alias readints = reads!int;