#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18 + 5;
int arr[101];
int dp[100001];
int grundy(int n, int k) {
  if (k < arr[1] || k == 0) return 0;
  if (dp[k] != -1) return dp[k];
  vector<int> v(n, 0);
  for (int i = 1; i <= n; i++) {
    if (k >= arr[i]) v[grundy(n, k - arr[i])]++;
  }
  int ans;
  for (int i = 0; i < n; i++) {
    if (v[i] == 0) {
      ans = i;
      break;
    }
  }
  return dp[k] = ans;
}
void solve() {
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> arr[i];
  }
  memset(dp, -1, sizeof dp);
  if (grundy(n, k) == 0)
    cout << "Second" << endl;
  else
    cout << "First" << endl;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(10);
  int T = 1;
  while (T--) {
    solve();
  }
}
