#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, unsigned long long int y) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) {
      res = res * x;
    }
    y = y >> 1;
    x = x * x;
  }
  return res;
}
long long int powermod(long long int x, unsigned long long int y,
                       long long int p) {
  long long int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) {
      res = (res * x) % p;
    }
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long int dp[100005][2];
long long int n;
vector<long long int> v;
long long int solve(long long int p, long long int s) {
  if (s < 0) {
    return (p % 2 ? 0 : 1);
  }
  if (dp[s][p] != -1) return dp[s][p];
  long long int ans = 0;
  if (p % 2 == 0) {
    long long int c = 0;
    for (long long int j = (long long int)(0); j < (long long int)(n); j++) {
      c += solve(p + 1, s - v[j]);
    }
    if (c > 0) ans = 1;
  } else {
    long long int c = 0;
    for (long long int j = (long long int)(0); j < (long long int)(n); j++) {
      c += (solve(p + 1, s - v[j]) == 0);
    }
    if (c > 0)
      ans = 0;
    else
      ans = 1;
  }
  dp[s][p] = ans;
  return ans;
}
int32_t main() {
  long long int k;
  cin >> n >> k;
  memset(dp, -1, sizeof(dp));
  for (long long int i = (long long int)(0); i < (long long int)(n); i++) {
    long long int t;
    cin >> t;
    v.push_back(t);
  }
  if (solve(0, k))
    cout << "First\n";
  else
    cout << "Second\n";
  return 0;
}
