#include <bits/stdc++.h>
using namespace std;
int n, k, a[1000], dp[100009];
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  memset(dp, 0, sizeof(dp));
  for (int i = 0; i < k; i++) {
    if (n == 0) dp[i] = 1;
  }
  for (int stones = 1; stones <= k; stones++) {
    for (int i = 1; i < n; i++) {
      if (i < a[i]) {
      } else {
        dp[stones] = 1 - dp[stones - a[i]];
      }
    }
  }
  if (dp[k])
    printf("First\n");
  else
    printf("Second\n");
  return 0;
}
