#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> inp;
vector<vector<int>> dp;
int stoney(int c, int k) {
  if (k <= 0) return !c;
  if (dp[k][c] != -1) return dp[k][c];
  int ans;
  for (int i = 0; i < n; i++) {
    ans = stoney(!c, k - inp[i]);
    if (ans == c) return dp[k][c] = ans;
  }
  return dp[k][c] = !c;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int k;
  cin >> n >> k;
  inp.resize(n);
  dp.assign(k + 1, vector<int>(2, -1));
  for (int i = 0; i < n; i++) {
    cin >> inp[i];
  }
  int ans = stoney(1, k);
  if (ans == 1) cout << "First" << '\n';
  if (ans == 0) cout << "Second" << '\n';
}
