#include <bits/stdc++.h>
using namespace std;
long long int n, k;
long long int static dp[100005];
vector<long long int> stones(n + 1);
long long int winner(long long int k) {
  dp[0] = 0;
  for (long long int i = 1; i <= k; ++i) {
    long long int ans = 0;
    for (long long int j = 1; j <= n; ++j) {
      if (stones[j] > i) continue;
      if (dp[i - stones[j]] == 0) {
        ans = 1;
        break;
      }
    }
    dp[i] = ans;
  }
  return dp[k];
}
int32_t main() {
  memset(dp, 0, sizeof(dp));
  cin >> n >> k;
  for (long long int i = 1; i <= n; ++i) {
    cin >> stones[i];
  }
  if (winner(k))
    cout << "First";
  else
    cout << "Second";
}
