#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
const double PI = acos(-1.0);
template <typename T>
T gcd(T a, T b) {
  return (b ? __gcd(a, b) : a);
}
template <typename T>
T lcm(T a, T b) {
  return (a * b) / gcd(a, b);
}
void solve() {
  long long int n, k;
  cin >> n >> k;
  vector<long long int> stones(n);
  for (long long int i = 0; i < (n); ++i) {
    cin >> stones[i];
  }
  vector<long long int> dp(k + 1, -1);
  for (long long int i = 0; i < (stones[0]); ++i) dp[i] = false;
  for (long long int i = 0; i < (n); ++i) {
    for (long long int s = 0; s < (k); ++s) {
      if (dp[s] != -1 && s + stones[i] <= k && dp[s + stones[i]] == -1) {
        dp[s + stones[i]] = 1 - dp[s];
      }
    }
  }
  cout << (dp[k] ? "First" : "Second") << "\n";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
