#include <stdio.h>

bool prime(int n) {
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return n >= 2;
}

int next_prime(int x) {
  x++;
  while (!prime(x)) x++;
  return x;
}

int main(void) {
  int y, x;
  scanf("%d %d", &y, &x);
  int dy = next_prime(y) - y;
  int dx = next_prime(x) - x;
  puts((dy + dx) % 2 == 1 ? "First" : "Second");
  return 0;
}