#include <bits/stdc++.h>
using namespace std;
double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005ll;
double PI = acos(-1);
int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1};
int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1};
const long long MOD = 1000000007;
void solve() {}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (auto &(z) : a) cin >> z;
  ;
  vector<int> dp(k + 1, 0);
  for (int(i) = (1); (i) <= (k); ++(i)) {
    for (int j = 0; i >= a[j]; j++) {
      dp[i] |= !dp[i - a[j]];
    }
  }
  cout << (dp[k] ? "First" : "Second") << endl;
  return 0;
}
