#include <bits/stdc++.h>
using namespace std;
int n, k, ar[105], dp[100005][2], mn;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  int i, j;
  cin >> n >> k;
  for (i = 0; i < n; i++) cin >> ar[i];
  memset(dp, -1, sizeof(dp));
  mn = *min_element(ar, ar + n);
  for (i = 0; i < mn; i++) dp[i][0] = 1, dp[i][1] = 0;
  for (i = mn; i < k + 1; i++) {
    dp[i][0] = 1, dp[i][1] = 0;
    for (j = 0; j < n; j++) {
      dp[i][0] = min(dp[i][0], dp[i - ar[j]][1]);
      dp[i][1] = max(dp[i][1], dp[i - ar[j]][0]);
    }
  }
  (dp[k][1]) ? cout << "First" : cout << "Second";
}
