#include <bits/stdc++.h>
using namespace std;
void solve();
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  solve();
}
using ll = long long;
const int MOD = 1e9 + 7;
const int inf = INT_MAX;
const int MAX_N = 1e5 + 7;
int n, k;
bool dp[MAX_N];
int a[MAX_N];
void solve() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= k; j++) {
      if (j >= a[i] && !dp[j - a[i]]) dp[j] = true;
    }
  }
  if (dp[k])
    cout << "First";
  else
    cout << "Second";
}
