#include <bits/stdc++.h>
using namespace std;
int n, k;
vector<int> choices;
long long dp[100001][2];
bool visited[100001][2];
long long calc(int remain, bool second) {
  if (remain < 0) {
    if (second)
      return 1;
    else
      return -1;
  }
  if (visited[remain][second] == true) {
    return dp[remain][second];
  }
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    ans += calc(remain - choices[i], 1 - second);
  }
  visited[remain][second] = true;
  return dp[remain][second] = ans;
}
int main() {
  cin >> n >> k;
  choices.resize(n);
  for (int i = 0; i < n; i++) {
    cin >> choices[i];
  }
  sort(choices.begin(), choices.end());
  int ans = calc(k, 0);
  if (ans < 0) {
    cout << "First" << endl;
  } else if (ans > 0) {
    cout << "Second" << endl;
  } else {
    int i = 0;
    while (true) {
      i++;
    }
  }
  return 0;
}
