#include <bits/stdc++.h>
using namespace std;
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int n, k;
  cin >> n >> k;
  vector<long long int> A(n);
  for (long long int i = 0; i < n; i++) cin >> A[i];
  sort(A.begin(), A.end());
  vector<vector<long long int>> dp(k + 1, vector<long long int>(2));
  dp[0][1] = 0;
  dp[0][0] = 1;
  for (long long int i = 1; i < k + 1; i++) {
    long long int x = lower_bound(A.begin(), A.end(), i) - A.begin();
    if (x < n && A[x] == i)
      dp[i][0] = dp[i - A[x]][1], dp[i][1] = dp[i - A[x]][0];
    else if (x > 0)
      dp[i][0] = dp[i - A[x - 1]][1], dp[i][1] = dp[i - A[x - 1]][0];
  }
  if (dp[k][0] == 0)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
