#include <bits/stdc++.h>
using namespace std;
int inf = 1 << 29;
long long longinf = (1ll << 60);
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, -1, 1};
int N;
int M;
int ans;
vector<int> nxt[100000];
vector<int> bfr[100000];
bool dp[100001];
signed main() {
  int n, k;
  cin >> n >> k;
  int a[n];
  for (long long i = (long long)0ll; i < (long long)n; i++) {
    cin >> a[i];
  }
  dp[0] = 0;
  for (long long i = (long long)1ll; i < (long long)k - 1 + 1; i++) {
    dp[i] = 1;
    for (long long j = (long long)0ll; j < (long long)n; j++) {
      if (i > a[j] && dp[i - a[j]]) {
        dp[i] = 0;
      }
    }
  }
  if (dp[k - 1])
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}
