import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


bool isPrime(int n) {
  if (n < 2) {
    return false;
  }
  for (int d = 2; d^^2 <= n; ++d) {
    if (n % d == 0) {
      return false;
    }
  }
  return true;
}

int solve(int x, int y) {
  const fx = isPrime(x);
  const fy = isPrime(y);
  int ret;
  if (fx && fy) {
    ret = 0;
  } else if (fx) {
    ret = isPrime(x + 1) ? 0 : (solve(x + 1, y) ^ 1);
  } else if (fy) {
    ret = isPrime(y + 1) ? 0 : (solve(x, y + 1) ^ 1);
  } else {
    // next prime parity
    const nx = (x <= 1) ? 0 : 1;
    const ny = (y <= 1) ? 0 : 1;
    ret = 0;
    ret ^= (nx - x - 1) & 1;
    ret ^= (ny - y - 1) & 1;
  }
  return ret;
}

void main() {
  try {
    for (; ; ) {
      const X = readInt();
      const Y = readInt();
      
      const ans = solve(X, Y);
      writeln(ans ? "First" : "Second");
    }
  } catch (EOFException e) {
  }
}