#include <bits/stdc++.h>
using namespace std;
long long int Lpow(long long int a, long long int b) {
  long long int ans = 1;
  while (b > 0) {
    if (b % 2) ans = (ans * a);
    a = (a * a);
    b = b / 2;
  }
  return ans;
}
long long int gcd(long long int a, long long int b) {
  if (a % b == 0)
    return b;
  else
    return gcd(b, a % b);
}
signed main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  int n, k;
  cin >> n >> k;
  vector<int> arr(n);
  int mi = 2147483647;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    mi = min(mi, arr[i]);
  }
  sort(arr.begin(), arr.end());
  vector<int> brr(100005, 0);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < mi; j++) {
      brr[arr[i] + j] = 1;
    }
  }
  for (int i = 1; i <= 100000; i++) {
    for (int j = 0; j < n; j++) {
      if (arr[j] < i && brr[i - arr[j]] == 0) brr[i] = 1;
    }
  }
  if (brr[k] == 1)
    cout << "First\n";
  else
    cout << "Second\n";
  return 0;
}
