#include <bits/stdc++.h>
using namespace std;
int n, k, dp[100004];
vector<int> stones;
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    stones.push_back(x);
  }
  for (int i = 0; i <= k; i++) {
    for (auto j : stones) {
      if (i - j >= 0 and !dp[i - j]) {
        dp[i - j] = 1;
      }
    }
  }
  puts(dp[k] ? "First" : "Second");
  return 0;
}
