#include <bits/stdc++.h>
using namespace std;
long long int n, k;
long long int a[105];
long long int t = 1000000007;
long long int dp[100005][2];
void init() {
  for (long long int i = 0; i < 100005; i++) {
    for (long long int j = 0; j < 2; j++) {
      dp[i][j] = -1;
    }
  }
}
long long int func(long long int rem, long long int pla) {
  if (rem < t) {
    return (pla + 1) % 2;
  }
  if (dp[rem][pla] != -1) {
    return dp[rem][pla];
  }
  long long int ans = 1000000007;
  for (long long int i = 0; i < n; i++) {
    ans = func(rem - a[i], (pla + 1) % 2);
    if (ans == pla) {
      break;
    }
  }
  if (ans == 1000000007) {
    ans = (pla + 1) % 2;
  }
  dp[rem][pla] = ans;
  return dp[rem][pla];
}
inline void solve() {
  init();
  cin >> n >> k;
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
    t = min(t, a[i]);
  }
  if (func(k, 0) == 0) {
    cout << "First" << '\n';
  } else {
    cout << "Second" << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tests = 1;
  while (tests--) {
    solve();
  }
}
