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