#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9;
long long fast_pow(long long x, long long y, long long p);
long long n, k, dp[105][100005];
void solve() {
  cin >> n >> k;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  for (long long j = 0; j <= k; j++) {
    for (long long i = 1; i <= n; i++) {
      if (j == 0) {
        dp[i][j] = 0;
        continue;
      }
      dp[i][j] = dp[i - 1][j];
      if (j - a[i - 1] >= 0) {
        dp[i][j] |= (!dp[i][j - a[i - 1]]);
      }
    }
  }
  if (dp[n][k])
    cout << "First"
         << "\n";
  else
    cout << "Second"
         << "\n";
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long test = 1;
  for (long long i = 1; i <= test; i++) {
    solve();
  }
  return 0;
}
long long fast_pow(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
