#include <bits/stdc++.h>
using namespace std;
int a[101];
bool dp[100005][2];
int main() {
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  for (int i = 0; i < n; i++) {
    dp[a[i]][0] = dp[a[i]][1] = 1;
  }
  for (int i = 0; i <= k; i++) {
    for (int j = 0; j < n && k - a[j] >= 0; j++) {
      for (int p = 0; p < 2; p++) {
        dp[k][p] |= !dp[k - a[j]][!p];
      }
    }
  }
  cout << (dp[k][0] ? "First" : "Second");
}
