#include <bits/stdc++.h>
using namespace std;
const long long int M = 1000000007;
long long int power(long long int x, 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 % p;
}
long long int modinver(long long int a, long long int b) {
  return (power(a, 1, M) * power(b, M - 2, M)) % M;
}
void SieveOfEratosthenes(int n) {
  bool prime[10005];
  memset(prime, true, sizeof(prime));
  for (int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
}
long long int n, a[102], k;
long long int dp[100002][3];
long long int kstonesans(long long int stones, long long int chance) {
  if (dp[stones][chance] != -1) return dp[stones][chance];
  if (chance == 0) {
    long long int ans = 0;
    for (int i = 0; i < n; ++i) {
      if (stones >= a[i]) {
        ans = ans || kstonesans(stones - a[i], 1 - chance);
        if (ans == 1) {
          break;
        }
      } else {
        break;
      }
    }
    dp[stones][chance] = ans;
    return ans;
  } else {
    long long int ans = 1;
    for (int i = 0; i < n; ++i) {
      if (stones >= a[i]) {
        ans = ans && kstonesans(stones - a[i], 1 - chance);
        if (ans == 0) {
          break;
        }
      } else {
        break;
      }
    }
    dp[stones][chance] = ans;
    return ans;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (int i = 0; i <= 100002; ++i) {
    dp[i][0] = -1;
    dp[i][1] = -1;
  }
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  sort(a, a + n);
  if (kstonesans(k, 0)) {
    cout << "First\n";
  } else {
    cout << "Second\n";
  }
}
