#include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
constexpr int INF = 100000000;
constexpr long long LINF = 10000000000000000ll;
constexpr int MOD = static_cast<int>(1e9 + 7);
constexpr double EPS = 1e-9;
static inline long long mod(long long x, long long m) {
  long long y = x % m;
  return (y >= 0 ? y : y + m);
}
int N, K;
int a[100];
bool dp[100001];
void solve() {
  dp[0] = false;
  for (long long i = 0ll; i < static_cast<long long>(K + 1); i++) {
    for (long long j = 0ll; j < static_cast<long long>(N); j++) {
      dp[i + a[j]] |= !dp[i];
    }
  }
  cout << (dp[K] ? "First" : "Second") << endl;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> N >> K;
  for (long long i = 0ll; i < static_cast<long long>(N); i++) cin >> a[i];
  solve();
  return 0;
}
