#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
int V, E, i, j, k, u, v, x, y, p, q, r, t, n, w, m;
vector<int> *g;
vector<bool> sn;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> k;
  long long a[n + 1];
  for (int i = 1; i <= n; i++) cin >> a[i];
  long long dp[n + 1][k + 1];
  for (int i = 0; i < k + 1; i++) dp[0][i] = 0;
  for (int i = 0; i < n + 1; i++) dp[i][0] = 0;
  dp[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= k; j++) {
      dp[i][j] = 1;
      for (int p = 1; p <= i; p++) {
        if (a[p] <= j) {
          dp[i][j] = dp[i][j] & dp[i][j - a[p]];
        } else {
          if (i == 1)
            dp[i][j] = dp[i][j] & 1;
          else
            dp[i][j] = dp[i][j] & dp[i - 1][j];
        }
      }
      dp[i][j] = dp[i][j] == 1 ? 0 : 1;
    }
  }
  if (dp[n][k] == 1)
    cout << "First\n";
  else
    cout << "Second\n";
}
