#include <bits/stdc++.h>
using namespace std;
int dp[101][100001];
int main() {
  int n, k;
  cin >> n >> k;
  int ankit[n + 1];
  for (int i = 1; i <= n; i++) {
    cin >> ankit[i];
  }
  for (int i = 0; i <= k; i++) {
    dp[0][i] = 0;
  }
  for (int i = 0; i <= n; i++) {
    dp[i][0] = 1;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= k; j++) {
      if (ankit[i] > j) {
        dp[i][j] = (dp[i - 1][j]);
        continue;
      }
      if (ankit[i] == j) {
        dp[i][j] = 1;
        continue;
      }
      if (dp[i - 1][j] == 1) {
        dp[i][j] = 1;
        continue;
      }
      if (dp[i][j - ankit[i]] == 1)
        dp[i][j] = 0;
      else
        dp[i][j] = 1;
    }
  }
  if (dp[n][k] == 1)
    cout << "First\n";
  else
    cout << "Second\n";
}
