#include <bits/stdc++.h>
using namespace std;
long long int em(long long int x, long long int n) {
  if (n == 0)
    return 1;
  else if (n % 2 == 0)
    return em((x % 1000000007 * x % 1000000007) % 1000000007, n / 2);
  else
    return (x % 1000000007 *
            em((x % 1000000007 * x % 1000000007) % 1000000007, (n - 1) / 2)) %
           1000000007;
}
long long int dp[10000009];
signed main() {
  std::ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, m, i, j, k, l;
  cin >> n >> k;
  long long int a[n + 1];
  for (i = 0; i < n; i++) cin >> a[i];
  memset(dp, 0, sizeof(dp));
  for (i = 0; i <= k; i++) {
    for (j = 0; j < n; j++) {
      if (a[j] <= i) dp[i] = 1 ^ (dp[i - a[j]]);
    }
  }
  if (dp[k])
    cout << "First"
         << "\n";
  else
    cout << "Second"
         << "\n";
}
