#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, k;
  cin >> n >> k;
  int arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  int dp[k];
  memset(dp, 0, sizeof(dp));
  for (int i = 0; i <= k; i++) {
    for (int j = 0; j < n; j++) {
      if (i >= arr[j] and dp[i - arr[j]] == 0) {
        dp[i] = 1;
        break;
      }
    }
  }
  cout << (dp[k] == 1 ? "First" : "Second");
}
int main() {
  int t;
  t = 1;
  while (t--) {
    solve();
  }
}
