#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const long long MOD = 1000000007;
const long long INF = 1e10;
const long long MAX_N = 1010;
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
long long lcm(long long x, long long y) {
  if (x == 0 || y == 0) return 0;
  return (x / gcd(x, y) * y);
}
bool dp[101010];
long long dx[4] = {0, 0, -1, 1};
long long dy[4] = {-1, 1, 0, 0};
long long a[303];
int main() {
  long long n, k;
  cin >> n >> k;
  for (long long i = 0; i < n; ++i) {
    cin >> a[i];
  }
  for (long long i = 0; i <= k; ++i) {
    for (long long j = 0; j < n; ++j) {
      if (dp[i] == false) {
        dp[i + a[j]] = true;
      }
    }
  }
  if (dp[k])
    puts("First");
  else {
    puts("Second");
  }
  return 0;
}
