#include <bits/stdc++.h>
using namespace std;
int bs_upper_bound(int a[], int n, int x) {
  int l = 0;
  int h = n;
  while (l < h) {
    int mid = l + (h - l) / 2;
    if (x >= a[mid]) {
      l = mid + 1;
    } else {
      h = mid;
    }
  }
  return l;
}
int bs_lower_bound(int a[], int n, int x) {
  int l = 0;
  int h = n;
  while (l < h) {
    int mid = l + (h - l) / 2;
    if (x <= a[mid]) {
      h = mid;
    } else {
      l = mid + 1;
    }
  }
  return l;
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second < b.second);
}
int minx, n;
int dp[100001][2];
int solve(int *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() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int k;
  cin >> n >> k;
  int a[n];
  minx = INT_MAX;
  for (int i = 0; i < n; i++) {
    cin >> a[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++) {
    if (a[i] <= k) {
      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";
}
