#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 1;
int min_val = MAX;
int n, k;
vector<int> dp(MAX);
vector<int> arr(100);
int calc(int left) {
  if (left < min_val) {
    return 0;
  }
  if (dp[left] != -1) {
    return dp[left];
  }
  int ans = 0;
  for (int i = 0; i < n; i++) {
    int val = 1 - calc(left - arr[i]);
    if (val > 0) {
      ans += val;
    }
    if (ans == 1) {
      break;
    }
  }
  return dp[left] = ans;
}
void solve() {
  cin >> n >> k;
  dp.assign(k + 1, -1);
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    min_val = min(min_val, arr[i]);
  }
  int result = calc(k);
  if (result == 1) {
    cout << "First" << '\n';
  } else {
    cout << "Second" << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  return 0;
}
