# -*- coding: utf-8 -*-
from bisect import bisect, bisect_left
from math import sqrt

def primes(N):
    sieve = [True]*(N+1)
    sieve[:2] = [False, False]
    P = []
    
    for i in range(2, N):
        if sieve[i]:
            P.append(i)
            for j in range(2*i, N, i):
                sieve[j] = False
    return P

def isprime(X, P):
    if X <= P[-1]:
        return X == P[bisect_left(P, X)]
    for p in P[:bisect(P, sqrt(X)+1)]:
        if X%p == 0:
            return False
    else:
        return True

P = primes(int(sqrt(2*10**9)))
A, B = map(int, input().split())

if not (isprime(A+1, P) or isprime(B, P)):
    X, Y = A+1, B
    secwin1 = False
    i = 0
    while (not isprime(X, P)):
        i += 1
        X += 1
        secwin1 = not secwin1
    
    i = 0
    while (not isprime(Y, P)):
        i += 1
        Y += 1
        secwin1 = not secwin1
else:
    secwin1 = True

if not (isprime(A, P) or isprime(B+1, P)):
    X, Y = A, B+1
    secwin2 = False
    i = 0
    while (not isprime(X, P)):
        i += 1
        X += 1
        secwin2 = not secwin2
    
    i = 0
    while (not isprime(Y, P)):
        i += 1
        Y += 1
        secwin2 = not secwin2
else:
    secwin2 = True

if secwin1 & secwin2:
    print("Second")
else:
    print("First")