#include <bits/stdc++.h>
using namespace std;
int calculateMex(set<int> Set) {
  int Mex = 0;
  while (Set.find(Mex) != Set.end()) Mex++;
  return (Mex);
}
int Grundy[100000 + 5];
int a[100000 + 5];
int calculateGrundy(int n, int k) {
  if (n == 0) return (0);
  if (Grundy[n] != -1) return (Grundy[n]);
  set<int> Set;
  for (int i = 1; i <= k; i++) Set.insert(calculateGrundy(n - a[i], k));
  Grundy[n] = calculateMex(Set);
  return (Grundy[n]);
}
int main() {
  int n, k;
  cin >> n >> k;
  memset(Grundy, -1, sizeof(Grundy));
  Grundy[0] = 0;
  for (int i = 1; i <= n; i++) {
    cin >> (a[i]);
    Grundy[a[i]] = a[i];
  }
  cout << ((calculateGrundy(k, n) > 0) ? "First" : "Second");
  return (0);
}
