#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const int inf = 1000000007;
const int MOD = 1000000007;
signed main() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < n; ++i) cin >> a[i];
  sort(a.begin(), a.end());
  vector<bool> dp(n + 1, false);
  for (int j = a[0]; j <= k; ++j) {
    bool flag = false;
    for (int i = 0; i < n; ++i) {
      if (j < a[i]) break;
      if (!dp[j - a[i]]) flag = true;
    }
    dp[j] = flag;
  }
  if (dp[k]) {
    cout << "First" << endl;
  } else {
    cout << "Second" << endl;
  }
  return 0;
}
