#include <bits/stdc++.h>
using namespace std;
long long int max(long long int a, long long int b) {
  if (a > b) return a;
  return b;
}
long long int min(long long int a, long long int b) {
  if (a < b) return a;
  return b;
}
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
long long int n, k;
long long int arr[100005];
long long int dp[100005];
long long int solve(long long int rem) {
  if (rem == 0) return 0;
  if (dp[rem] != -1) return dp[rem];
  long long int ans = 0;
  for (long long int i = 0; i < n + 0; i += 1) {
    if ((rem - arr[i]) >= 0) {
      if (solve(rem - arr[i]) == 0) {
        ans = 1;
        break;
      }
    }
  }
  dp[rem] = ans;
  return ans;
}
int32_t main() {
  fastIO();
  memset(dp, -1, sizeof(dp));
  cin >> n >> k;
  for (long long int i = 0; i < n + 0; i += 1) cin >> arr[i];
  if (solve(k))
    cout << "First";
  else
    cout << "Second";
  cout << endl;
  ;
  return 0;
}
