#include <bits/stdc++.h>
using namespace std;
const string nl = "\n";
const long long MOD = 1e9 + 7;
const long long ARR_MAX = 1e5 + 1;
const long long INF = 1e14;
int dp[ARR_MAX], prev[ARR_MAX];
void solve() {
  int n, k;
  cin >> n >> k;
  int a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = a[0]; i <= k; i++) {
    int mx = 0;
    for (int j = 0; j < n; j++) {
      mx = max(mx, 1 - dp[max(i - a[j], 0)]);
    }
    dp[i] = mx;
  }
  if (dp[k] == 0) {
    cout << "Second" << nl;
  } else {
    cout << "First" << nl;
  }
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
