#include <bits/stdc++.h>
using namespace std;
long long int multiply(long long int a, long long int b) {
  long long int ans = (a % 1000000007 * b % 1000000007) % 1000000007;
  return ans;
}
long long int add(long long int a, long long int b) {
  long long int ans = (a % 1000000007 + b % 1000000007) % 1000000007;
  return ans;
}
int power(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
void fastio() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
vector<long long int> adj[100001];
long long int vis[100001] = {0};
long long int indegree[100001] = {0};
long long int dist[100001] = {0};
void dfs(long long int n) {
  vis[n] = 1;
  for (auto node : adj[n]) {
    dist[node] = max(dist[node], dist[n] + 1);
    indegree[node]--;
    if (indegree[node] == 0) dfs(node);
  }
}
long long int dp[100001] = {0};
void solve() {
  long long int n, k;
  cin >> n >> k;
  long long int a[n], i, j;
  for (i = 0; i < n; i++) cin >> a[i];
  for (i = 1; i <= k; i++) {
    for (j = 0; j < n; j++) {
      if (k - a[j] >= 0 && dp[k - a[j]] == 0) dp[i] = 1;
    }
  }
  if (dp[k])
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
int main() {
  fastio();
  long long int t;
  t = 1;
  while (t--) {
    solve();
  }
}
