#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int inf = (1 << 30);
string toBin(long long int a);
int dp[105][100005];
void solve() {
  int i, j, n, k;
  cin >> n >> k;
  int arr[n];
  for (i = 0; i < n; i++) {
    cin >> arr[i];
  }
  memset(dp, 0, sizeof(dp));
  for (i = arr[0]; i <= k; i++) {
    dp[0][i] = !dp[0][i - arr[0]];
  }
  for (i = 1; i < n; i++) {
    for (j = 1; j <= k; j++) {
      if (j < arr[i]) {
        dp[i][j] = dp[i - 1][j];
      } else {
        dp[i][j] = dp[i - 1][j] || (!dp[i][j - arr[i]]);
      }
    }
  }
  cout << (dp[n - 1][k] ? "First" : "Second");
}
int main() {
  int t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
string toBin(long long int a) {
  string s = "";
  while (a > 0) {
    if (a & 1) {
      s = "1" + s;
    } else {
      s = "0" + s;
    }
    a >>= 1;
  }
  return s;
}
