#include <bits/stdc++.h>
using namespace std;
const long double GOLDEN_RATIO =
    1.6180339887498949025257388711906969547271728515625;
const long double PI = acos(-1.0);
const int BLOCK = 333;
int dp[200020], N, nums[200020];
int solve(int K) {
  if (dp[K] != -1) return dp[K];
  for (int i = 1; i <= N; i++)
    if (nums[i] <= K)
      if (!solve(K - nums[i])) return true;
  return false;
}
int main(int argc, char const *argv[]) {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  memset(dp, -1, sizeof dp);
  int K;
  cin >> N >> K;
  for (int i = 1; i <= N; i++) cin >> nums[i];
  cout << (solve(K) ? "First" : "Second") << '\n';
  return 0;
}
