#include <bits/stdc++.h>
using namespace std;
int32_t main() {
  long long int n, k, a[101];
  cin >> n >> k;
  for (long long int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  long long int dp[100001];
  dp[0] = 0;
  for (long long int i = 1; i <= k; i++) {
    for (long long int j = 0; j < n; j++) {
      if (i >= a[j]) {
        if (dp[i - a[j]] == 0) dp[i] = 1;
      }
    }
    dp[i] = max(dp[i], 0LL);
  }
  if (dp[k] == 1)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}
