#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[105];
int dp[100005][2];
int solve(int i, int ok) {
if (dp[i][ok] != -1) return dp[i][ok];
int cur;
if (ok == 0) cur = 1;
else cur = 0;
if (ok == 0) {
for (int j = 1; j <= n; j++)
if (i >= a[j])
cur = min(cur, solve(i - a[j], 1 - ok));
} else {
for (int j = 1; j <= n; j++)
if (i >= a[j])
cur = max(cur, solve(i - a[j], 1 - ok));
}
return dp[i][ok] = cur;
}
main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
freopen("TEST.inp", "r", stdin);
freopen("TEST.out", "w", stdout);
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i];
memset(dp, -1, sizeof(dp));
if (solve(k, 0) == 0) cout << "First" << '\n';
else cout << "Second" << '\n';
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBuLCBrOwppbnQgYVsxMDVdOwppbnQgZHBbMTAwMDA1XVsyXTsKCmludCBzb2x2ZShpbnQgaSwgaW50IG9rKSB7CiAgICBpZiAoZHBbaV1bb2tdICE9IC0xKSByZXR1cm4gZHBbaV1bb2tdOwogICAgaW50IGN1cjsKICAgIGlmIChvayA9PSAwKSBjdXIgPSAxOwogICAgZWxzZSBjdXIgPSAwOwogICAgaWYgKG9rID09IDApIHsKICAgICAgICBmb3IgKGludCBqID0gMTsgaiA8PSBuOyBqKyspCiAgICAgICAgICAgIGlmIChpID49IGFbal0pCiAgICAgICAgICAgICAgICBjdXIgPSBtaW4oY3VyLCBzb2x2ZShpIC0gYVtqXSwgMSAtIG9rKSk7CiAgICB9IGVsc2UgewogICAgICAgIGZvciAoaW50IGogPSAxOyBqIDw9IG47IGorKykKICAgICAgICAgICAgaWYgKGkgPj0gYVtqXSkKICAgICAgICAgICAgICAgIGN1ciA9IG1heChjdXIsIHNvbHZlKGkgLSBhW2pdLCAxIC0gb2spKTsKICAgIH0KICAgIHJldHVybiBkcFtpXVtva10gPSBjdXI7Cn0KCm1haW4oKSB7CiAgICBpb3NfYmFzZTo6c3luY193aXRoX3N0ZGlvKGZhbHNlKTsKICAgIGNpbi50aWUoMCk7IGNvdXQudGllKDApOwogICAgZnJlb3BlbigiVEVTVC5pbnAiLCAiciIsIHN0ZGluKTsKICAgIGZyZW9wZW4oIlRFU1Qub3V0IiwgInciLCBzdGRvdXQpOwogICAgY2luID4+IG4gPj4gazsKICAgIGZvciAoaW50IGkgPSAxOyBpIDw9IG47IGkrKykgY2luID4+IGFbaV07CgogICAgbWVtc2V0KGRwLCAtMSwgc2l6ZW9mKGRwKSk7CgogICAgaWYgKHNvbHZlKGssIDApID09IDApIGNvdXQgPDwgIkZpcnN0IiA8PCAnXG4nOwogICAgZWxzZSBjb3V0IDw8ICJTZWNvbmQiIDw8ICdcbic7CgogICAgcmV0dXJuIDA7Cn0K