#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
const long long int INF = (long long int)1e18;
int main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  vector<int> dp(k + 1, 0);
  dp[0] = 0;
  for (int j = 0; j < n; j++) {
    int x;
    cin >> x;
    for (int i = 1; i <= k; i++)
      if (i >= x) dp[i] = max(dp[i], dp[i - x] ^ 1);
  }
  if (dp[k])
    cout << "First";
  else
    cout << "Second";
  return 0;
}
