#include <bits/stdc++.h>
using namespace std;
long long int modF = 1e9 + 7;
long long int INF = 1e11;
void solve() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<int> dp(k + 1);
  for (int i = 0; i <= k; i++) {
    if (i == 0) {
      dp[i] = 2;
    } else {
      int pos = 0;
      for (int j = 0; j < n && a[j] <= k; j++) {
        if (dp[i - a[j]] == 2) {
          pos = 1;
          break;
        }
      }
      if (pos) {
        dp[i] = 1;
      } else {
        dp[i] = 2;
      }
    }
  }
  if (dp[k] == 1) {
    cout << "First\n";
  } else {
    cout << "Second\n";
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << setprecision(10);
  solve();
  return 0;
}
