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