#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<vector<int>> dp(2, vector<int>(k + 1, 0));
  for (int i = 0; i < n; i++) {
    dp[0][a[i]] = 1;
    dp[1][a[i]] = 1;
  }
  int m = 1;
  for (int i = 1; i <= k; i++) {
    m = !m;
    for (int j = 0; j < n; j++) {
      if (i - a[j] >= 0 && dp[!m][i - a[j]] == 0) {
        dp[m][i] = 1;
        break;
      }
    }
  }
  if (dp[0][k]) {
    cout << "First";
  } else {
    cout << "Second";
  }
  return 0;
}
