#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
int main() {
  long long int n, k;
  cin >> n >> k;
  long long int x[n];
  set<long long int> s;
  for (long long int i = 0; i < n; i++) {
    cin >> x[i];
    s.insert(x[i]);
  }
  long long int p;
  for (long long int i = 1; i < 1e5 + 1; i++) {
    long long int count = 0;
    for (long long int j = 0; j < n; j++) {
      if (s.find(i - x[j]) != s.end()) {
        count++;
      } else
        break;
    }
    if (count == n) {
      p = i;
      break;
    }
  }
  if (k % p)
    cout << "First";
  else
    cout << "Second";
  return 0;
}
