#include <bits/stdc++.h>
using namespace std;
int dp[100005][3], n;
int arr[105];
int func(int num, int turn) {
  if (num < 0) return turn;
  if (num == 0) return turn ^ 1;
  int &ret = dp[num][turn];
  if (ret != -1) return ret;
  int temp[2] = {0};
  for (int i = 0; i < n; i++) {
    temp[func(num - arr[i], turn ^ 1)]++;
  }
  if (temp[turn] > 0)
    ret = turn;
  else
    ret = turn ^ 1;
  return dp[num][turn];
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  ;
  int k;
  cin >> n >> k;
  for (long long i = 0; i < n; i++) cin >> arr[i];
  if (n == 1) {
    int div = k / n;
    if (div % 2 != 0) dp[k][1] = 1;
  } else {
    memset(dp, -1, sizeof(dp));
    func(k, 1);
  }
  if (dp[k][1] == 1)
    cout << "First";
  else
    cout << "Second";
}
