#include <bits/stdc++.h>
using namespace std;
int n, a[105], k, f[200005], len[200005], minn = 0x3f3f3f3f;
bool cmp(int a, int b) { return a > b; }
int main(void) {
  scanf("%d %d", &n, &k);
  memset(f, -1, sizeof(f));
  for (int i = 1; i <= n; i++)
    scanf("%d", &a[i]), f[a[i]] = 1, minn = min(minn, a[i]), len[a[i]] = 1;
  for (int i = 0; i <= k; i++)
    if (i < minn) f[i] = 0, len[i] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = a[i]; j < minn + a[i]; j++) f[j] = 1, len[j] = 1;
  }
  for (int i = 1; i <= k; i++) {
    for (int j = 1; j <= n; j++) {
      if (a[j] > i) continue;
      if (f[i] == -1) {
        f[i] = 1 - f[i - a[j]];
        len[i] = 1 + len[i - a[j]];
      } else {
        if (len[i] < 1 + len[i - a[j]]) {
          len[i] = 1 - len[i - a[j]];
          f[i] = 1 - f[i - a[j]];
        }
      }
    }
  }
  for (int i = k; i; i--) {
    if (f[i] != -1) {
      if (f[i] == 1)
        printf("First\n");
      else
        printf("Second\n");
      return 0;
    }
  }
}
