#include<stdio.h>

int isPrime(int n){
  if(n<=1) return 0;
  if(n<=3) return 1;
  if(n%2==0 || n%3==0) return 0;
  int k=7;
  while(k*k<=n){
    if(n%(k-2)==0 || n%k==0) return 0;
    k+=6;
  }
  k-=2;
  if(k*k<=n && n%k==0) return 0;
  return 1;
}

void run(void){
  int x,y;
  scanf("%d%d",&x,&y);
  int i=0;
  while(!isPrime(x+i)) i++;
  int j=0;
  while(!isPrime(y+j)) j++;
  puts(i==0 || j==0 || (i+j)%2==1?"First":"Second");
}

int main(void){
  run();
  return 0;
}