#include <bits/stdc++.h>
using namespace std;
const int Max = 10000;
int dp[Max];
void K(int n, int k, vector<int>& a) {
  for (int i = 1; i <= k; i++) {
    for (int j = 0; j < n; j++) {
      if (i - j >= 0 && !dp[i - j]) {
        dp[i] = 1;
      }
    }
  }
  if (dp[k] == true) {
    cout << "Second" << endl;
  } else {
    cout << "First" << endl;
  }
}
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  int val;
  for (int i = 0; i < n; i++) {
    cin >> val;
    a.push_back(val);
  }
  K(n, k, a);
  return 0;
}
