#include <bits/stdc++.h>
using namespace std;
const int N = 105, K = 100005;
int a[N], dp[K];
vector<int> q;
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + n + 1);
  for (int i = 0; i < a[1]; i++) dp[i] = 0;
  for (int i = a[1]; i <= k; i++) {
    for (int j = 1; j <= n; j++)
      if (!dp[i - a[j]]) dp[i] = 1;
  }
  puts(dp[k] ? "First" : "Second");
  return 0;
}
