#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int n, k;
int dp[100010];
bool rec(int x, vector<int> a) {
  if (dp[x] >= 0) return dp[x];
  bool tmp;
  int count;
  for (int i = 0; i < n; i++) {
    if (x - a[i] < 0) {
      tmp = tmp | 0;
      count += 1;
    } else
      tmp = tmp | rec(x - a[i], a);
  }
  if (tmp == 1 or count == n)
    return dp[x] = 0;
  else
    return dp[x] = 1;
}
int main() {
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i <= k; i++) {
    dp[i] = -1;
  }
  if (rec(k, a) == 0)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}
