#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, k;
int ara[105];
int dp[N];
int solve(int k) {
  for (int i = 1; i <= k; i++) {
    for (int j = 0; j < n; j++) {
      if (i - ara[j] <= 0)
        dp[i] = 1;
      else if (!dp[i - ara[j]])
        dp[i] = 1;
    }
  }
  return dp[k];
}
int main() {
  {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
  };
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> ara[i];
  if (solve(k))
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
