#include <bits/stdc++.h>
using namespace std;
const int MAXN = 305;
bool dp[100000005][2];
int a[MAXN], n;
int dfs(int k, int t) {
  printf("%d %d\n", k, t);
  if (dp[k][t] > 0) return dp[k][t];
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    if (k >= a[i]) ans |= !dfs(k - a[i], !t);
  }
  return dp[k][t] = ans;
}
int main() {
  int k;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  if (dfs(k, 0) == false)
    printf("Second\n");
  else
    printf("First\n");
  return 0;
}
