#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
const long long int INF = 1e9;
const long long int MAXN = 1e9;
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<bool> dp(k + 1, false);
  for (int i = 1; i <= k; i++) {
    for (int j = 0; j < n; j++) {
      if (i - a[j] >= 0 && !dp[i - a[j]]) {
        dp[i] = !dp[i];
      }
    }
  }
  cout << (dp[k] ? "First" : "Second") << endl;
  return 0;
}
