#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long maxn = 305;
const long long inf = 1e9 + 7;
long long dp[maxn];
long long n, k;
long long a[maxn];
int main() {
  cin >> n >> k;
  memset(dp, 0, sizeof(dp));
  for (long long i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i <= k; i++) {
    if (!dp[i])
      for (long long j = 0; j < n; j++) {
        if (i + a[j] <= k) dp[i + a[j]] = 1;
      }
  }
  if (dp[k])
    cout << "First\n";
  else
    cout << "Second\n";
}
