#include <bits/stdc++.h>
using namespace std;
int a[100];
int dp[100005];
int n, k;
bool find_ans(int K = k) {
  if (K < 0) {
    return true;
  } else if (dp[K] != -1) {
    return dp[K];
  } else {
    for (int i = 0; i < n; ++i) {
      bool lost = find_ans(K - a[i]);
      if (!lost) {
        dp[K] = 1;
        return dp[K];
      }
    }
    dp[K] = 0;
    return dp[K];
  }
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  for (int i = 0; i <= k; ++i) {
    dp[i] = -1;
  }
  bool ans = find_ans();
  if (ans) {
    cout << "First\n";
  } else {
    cout << "Second\n";
  }
  return 0;
}
