def solve():
  N, M = map(int, input().split())
  A = list(map(int, input().split()))[::-1]
  first = [0]*N
  remain = A[0]-1-(1-M)
  get_all = A[0]-M
  if A[0]>1:
    if M==0:
      first[0] = get_all
    else:
      first[0] = remain
  else:
    first[0] = get_all
  for i in range(1,N):
    remain = A[i]-1-(1-M)
    get_all = A[i]-M
    if A[i]>1:
      first[i] = max(first[i-1]+remain,-first[i-1]+get_all)
    else:
      first[i] = -first[i-1]+get_all
  if first[-1]>0:
    return 'First'
  return 'Second'
print(solve())