#include <bits/stdc++.h>
using namespace std;
long long minx;
int n;
int dp[5000001][2];
int solve(long long *a, int rem, int moves) {
  if (dp[rem][moves] != -1) return dp[rem][moves];
  for (int i = 0; i < n; i++) {
    if (solve(a, rem - a[i], !moves) == moves) {
      dp[rem][moves] = moves;
      return moves;
    }
  }
  dp[rem][moves] = !moves;
  return dp[rem][moves];
}
int main() {
  int k;
  cin >> n >> k;
  long long a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  minx = a[0];
  for (int i = 0; i < n; i++) {
    minx = min(a[i], minx);
  }
  for (int i = 0; i <= k; i++) {
    for (int j = 0; j < 2; j++) dp[i][j] = -1;
  }
  for (int i = 0; i < n; i++) {
    dp[a[i]][0] = 0;
    dp[a[i]][1] = 1;
  }
  for (int i = 0; i < minx; i++) {
    dp[i][0] = 1;
    dp[i][1] = 0;
  }
  int x = solve(a, k, 0);
  if (dp[k][0] == 1)
    cout << "Second";
  else
    cout << "First";
}
