#include <bits/stdc++.h>
using namespace std;
int dp[100005];
int a[101];
int n, k;
bool solve(int k) {
  if (k == 0) {
    return 0;
  }
  if (dp[k] != -1) {
    return dp[k];
  }
  for (int i = 0; i < n; i++) {
    if (k >= a[i] && solve(k - a[i]) == false) {
      dp[k] = 1;
    }
  }
  return dp[k];
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  memset(dp, -1, sizeof(dp));
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  bool ans = solve(k);
  if (ans) {
    cout << "First"
         << "\n";
  } else {
    cout << "Second"
         << "\n";
  }
}
