#include <bits/stdc++.h>
using namespace std;
const long long int inf = 1000000000;
const long long int MOD = 1000000007;
long long int a[101], n;
long long int dp[100001];
long long int recur(long long int stones) {
  long long int ans = 0;
  if (stones < 0) return 0;
  if (stones == 0) return 1;
  if (dp[stones] != -1) return dp[stones];
  dp[stones] = 0;
  for (long long int i = 0; i < n; i++) {
    dp[stones] |= recur(stones - a[i]);
  }
  return !dp[stones];
}
int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  register long long int i, j, k, x, y, m, t, q, temp, sum = 0, count = 0,
                                                       f = 1;
  cin >> n >> k;
  for (i = 0; i <= k; i++) {
    dp[i] = -1;
  }
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  x = recur(k);
  if (x == 0)
    cout << "First";
  else
    cout << "Second";
}
