#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
using ll = long long;
bool dp[10010];
int main() {
  int n, k;
  cin >> n >> k;
  int a[n];
  for (int i = 0; i < (int)(n); i++) {
    cin >> a[i];
  }
  for (int i = 0; i < (int)(k + 1); i++) {
    dp[i] = 0;
    for (int j = 0; j < (int)(n); j++) {
      if (i - a[j] >= 0) dp[i] |= !dp[i - a[j]];
    }
  }
  cout << ((dp[k]) ? "First" : "Second") << endl;
}
