#include <bits/stdc++.h>
const int N = 100 + 10;
const int M = 1e5 + 10;
int a[N], f[M], s[M], n, m, x, y;
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  s[0] = 1;
  for (int i = 0; i <= m; i++)
    for (int j = 1; j <= n; j++)
      if (i + a[j] <= m) {
        s[i + a[j]] += f[i];
        f[i + a[j]] += s[i];
      } else
        break;
  for (int i = m; i > m - a[1]; i--) {
    if (s[i] >= n) x++;
    if (f[i] >= n) y++;
  }
  if (x <= y)
    puts("First");
  else
    puts("Second");
  return 0;
}
