#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t = 1;
  while (t--) {
    int n, k;
    cin >> n >> k;
    long long int arr[n];
    for (int i = 0; i < n; i++) {
      cin >> arr[i];
    }
    sort(arr, arr + n);
    long long int dp[k + 1];
    dp[0] = 1;
    for (int i = 1; i < arr[0]; i++) {
      dp[i] = 1;
    }
    dp[arr[0]] = 0;
    for (int i = arr[0] + 1; i <= k; i++) {
      vector<int> res;
      for (int j = 0; j < n; j++) {
        if (arr[j] > i) {
          break;
        } else {
          res.push_back(dp[i - arr[j]]);
        }
      }
      if (find(res.begin(), res.end(), 1) != res.end()) {
        dp[i] = 0;
      } else
        dp[i] = 1;
    }
    if (dp[k] == 0) {
      cout << "First" << endl;
    } else
      cout << "Second" << endl;
  }
  return 0;
}
