#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long MAX = 2e6 + 7;
const long long dx[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
const long long dy[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
long long i, j, k, t, n, q, l, r, mid;
vector<long long> v(101);
long long dp[MAX];
void solve() {
  cin >> n >> k;
  for (i = 0; i < n; i++) cin >> v[i];
  for (i = 0; i < k + 1; i++) {
    for (auto x : v) {
      if (i >= x && dp[i - x] == 0) dp[i] = 1;
    }
  }
  if (dp[k])
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  solve();
  return 0;
}
