#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 69;
int n, k;
int dp[N], A[N];
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> A[i];
  }
  sort(A + 1, A + 1 + n);
  for (int i = A[1]; i <= k; i++) {
    for (int j = 1; j <= n; j++) {
      dp[i] |= (dp[i - A[j]] ^ 1);
    }
  }
  if (dp[k])
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
