#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
long long n, k, arr[105], dp[100005];
long long solve(long long i) {
  if (i <= 0) return 0;
  if (i < arr[1]) return dp[i] = 0;
  if (dp[i] != -1) return dp[i];
  long long res = 1;
  for (long long j = (1); j < (n + 1); j++) res &= solve(i - arr[j]);
  if (res) return dp[i] = 0;
  return dp[i] = 1;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> k;
  for (long long i = (1); i < (n + 1); i++) cin >> arr[i];
  memset(dp, -1, sizeof(dp));
  if (solve(k))
    cout << "First"
         << "\n";
  else
    cout << "Second"
         << "\n";
  return 0;
}
