#include <bits/stdc++.h>
using namespace std;
long long int n, k;
long long int mn;
long long int ans;
long long int arr[105];
long long int dp[100005];
long long int solve(long long int stone) {
  if (stone < mn) return 0;
  if (dp[stone] != -1) return dp[stone];
  for (long long int i = 1; i <= n; i++) {
    if (stone >= arr[i]) {
      if (solve(stone - arr[i]) == 0) return dp[stone] = 1;
    }
  }
  return dp[stone] = 0;
}
int main() {
  scanf("%lld%lld", &n, &k);
  mn = INT_MAX;
  for (long long int i = 1; i <= n; i++) {
    scanf("%lld", &arr[i]);
    mn = min(mn, arr[i]);
  }
  ans = solve(k);
  if (ans)
    printf("First\n");
  else
    printf("Second\n");
  return 0;
}
