#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int a[100];
int dp[N];
int main() {
  int n, k, min = 1;
  cin >> k >> n;
  dp[0] = 2;
  for (int i = 0; i < k; i++) {
    cin >> a[i];
    dp[a[i]] = 1;
    if (min < dp[i]) min = dp[i];
  }
  for (int i = min; i <= n; i++) {
    int w = -1;
    for (int j = 0; j < k; j++)
      if (i - a[j] >= 0 && dp[i] == 0) {
        if (dp[i - a[j]] == 2) {
          w = 1;
          dp[i] = 1;
          break;
        }
        w = 0;
      }
    if (w == 0) dp[i] = 2;
  }
  cout << (dp[n] == 1 ? "First" : "Second");
  cin >> n;
  return 0;
}
