#include <bits/stdc++.h>
using namespace std;
int dp[2][100002];
int n;
int a[101];
int k;
int solve(int player, int stone) {
  if (stone < 0) return 0;
  if (stone == 0) return 1;
  if (dp[player][stone] != -1)
    return dp[player][stone];
  else {
    int ans = 0;
    for (int i = 0; i < n; i++) ans = ans | solve(player ^ 1, stone - a[i]);
    return dp[player][stone] = ans;
  }
}
int main() {
  int i, j;
  cin >> n >> k;
  for (i = 0; i < n; i++) cin >> a[i];
  for (i = 0; i < 2; i++)
    for (j = 0; j <= 100000; j++) dp[i][j] = -1;
  cout << (solve(0, k) ? "First" : "Second");
}
