def is_prime(n):
    if n <= 1:
        return False
    elif n <= 3:
        return True
    elif n % 2 == 0:
        return False
    d = n - 1
    s = 0
    while d % 2 == 0:
        d //= 2
        s += 1
    for a in [2, 3, 5, 7, 11, 13]:
        if a >= n:
            continue
        x = pow(a, d, n)
        if x == 1 or x == n - 1:
            continue
        for _ in range(s - 1):
            x = pow(x, 2, n)
            if x == n - 1:
                break
        else:
            return False
    return True

def compute_f(a, M):
    if a == 0:
        return 0
    elif a == 1:
        return 1 - M
    else:
        if is_prime(a):
            if a == 2:
                return max(2 - M, M)
            else:
                if M == 0:
                    return a
                else:
                    return a - 2 + M
        else:
            if M == 0:
                return a
            else:
                return a - 2 + M

n, M = map(int, input().split())
A = list(map(int, input().split()))

sum_total = 0
sign = 1
for a in A:
    f = compute_f(a, M)
    sum_total += sign * f
    sign *= -1

print("First" if sum_total > 0 else "Second")