#include <bits/stdc++.h>
using namespace std;
long long n;
long long a[102];
long long dp[102];
long long F(long long x) {
  if (dp[x] != -1) return dp[x];
  long long ret = 0;
  for (long long i = 1; i <= n; i++) {
    if (a[i] <= x) ret = ret | F(x - a[i]);
  }
  return dp[x] = !ret;
}
int main() {
  long long k;
  scanf("%lld %lld", &n, &k);
  for (long long i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
  }
  memset(dp, -1, sizeof dp);
  if (!F(k))
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}
