#include <bits/stdc++.h>
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
using namespace std;
bool dp[100010];
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> v(n);
  for (long long i = 0; i < n; ++i) {
    cin >> v[i];
  }
  for (long long i = 0; i < n; ++i) {
    for (long long j = 0; j < k + 1; ++j) {
      if (j + v[i] <= k) dp[j + v[i]] |= !dp[j];
    }
  }
  if (dp[k]) {
    cout << "First\n";
  } else {
    cout << "Second\n";
  }
  return 0;
}
