#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
int N, K;
int main() {
  int i, j, k;
  vector<int> dp(100010, -1);
  int a[105];
  int MIN = 9999999;
  int n;
  cin >> N >> K;
  for (i = 0; i <= N - 1; i++) {
    cin >> a[i];
  }
  for (i = 0; i <= K; i++) {
    for (j = 0; j <= N - 1; j++) {
      if (dp[i] == -1) {
        n = min(i + a[j], 10000);
        dp[n] = 1;
      }
    }
  }
  if (dp[K] == -1) {
    cout << "Second" << endl;
  } else {
    cout << "First" << endl;
  }
}
