#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
int n, k;
int a[101];
int dp[100001];
int recur(int i) {
  if (i < 0) return 0;
  if (i == 0) return 1;
  if (dp[i] != -1) return dp[i];
  dp[i] = 0;
  for (int i = 0; i < n; i++) {
    int x = recur(i - a[i]);
    if (x) {
      dp[i] = 1;
      break;
    }
  }
  return dp[i];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout << fixed;
  cout.precision(12);
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i <= 1e5; i++) dp[i] = -1;
  if (recur(k)) {
    cout << "First"
         << "\n";
  } else
    cout << "Second"
         << "\n";
  return 0;
}
