#include <bits/stdc++.h>
using namespace std;
int dp[2][100005];
int f(int x, int k, int val[], int n) {
  if (dp[x][k] != -1) return dp[x][k];
  int flag = !x;
  for (int i = 0; i < n; i++) {
    if (k < val[i])
      flag = !x;
    else if (k == val[i])
      flag = x;
    else {
      flag = f(!x, k - val[i], val, n);
    }
    if (flag == x) break;
  }
  if (flag == x)
    dp[x][k] = x;
  else
    dp[x][k] = !x;
  return dp[x][k];
}
int main() {
  memset(dp, -1, sizeof(dp));
  int n, k;
  cin >> n >> k;
  int val[n];
  for (int i = 0; i < n; i++) cin >> val[i];
  if (n == 1) {
    if (k % val[0] == 0)
      cout << "Second";
    else
      cout << "First";
    return 0;
  }
  int flag = 1;
  for (int i = 0; i < n; i++) {
    dp[0][k] = f(1, k - val[i], val, n);
    if (dp[0][k] == 0) {
      flag = 0;
      break;
    }
  }
  if (flag == 0)
    cout << "First";
  else
    cout << "Second";
}
