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