#include <bits/stdc++.h>
using namespace std;
int solve(int n, int k, vector<int> &v) {
  int dp[k + 1];
  dp[0] = 0;
  for (int i = 1; i < v.at(1); i++) {
    dp[i] = 0;
  }
  for (int i = v.at(1); i <= k; i++) {
    int flag = 1;
    for (int j = 1; j <= n; j++) {
      if (dp[i - v.at(j)] == 0) {
        dp[i] = 1;
        flag = 0;
        break;
      }
    }
    if (flag == 1) {
      dp[i] = 0;
    }
  }
  return dp[k];
}
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> v(n + 1);
  for (int i = 1; i <= n; i++) {
    cin >> v.at(i);
  }
  solve(n, k, v) == 1 ? (cout << "First") : (cout << "Second");
  return 0;
}
