#include <bits/stdc++.h>
using namespace std;
long double pie = 3.141592653589;
long long mod = 1e9 + 7;
bool Compare(pair<long long, long long> a, pair<long long, long long> b) {
  long long l1 = a.second - a.first + 1;
  long long l2 = b.second - b.first + 1;
  if (l1 != l2) return l1 > l2;
  return a.first > b.first;
}
std::priority_queue<
    pair<long long, long long>, std::vector<pair<long long, long long>>,
    std::function<bool(pair<long long, long long>, pair<long long, long long>)>>
    pq(Compare);
void solve() {
  long long n, k;
  cin >> n >> k;
  vector<bool> dp(k + 1);
  for (long long i = 0; i < (long long)n; ++i) {
    long long x;
    cin >> x;
    for (long long stone = k; stone >= 0; --stone) {
      if (stone >= x) {
        if (!dp[stone - x]) dp[stone] = 1;
      }
    }
  }
  if (dp[k])
    cout << "First\n";
  else
    cout << "Second\n";
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  while (t--) solve();
  return 0;
}
