#include <bits/stdc++.h>
using namespace std;
long long INFL = 1000000000000000010;
int INF = 2147483600;
long long MOD = 1000000007;
bool dp[200010];
int main(void) {
  int N, K;
  cin >> N >> K;
  vector<int> A(N);
  for (int i = 0; i < N; i++) cin >> A[i];
  dp[0] = 0;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j <= K; j++) {
      if (j - A[i] < 0) continue;
      if (dp[j - A[i]] == 0) {
        dp[j] = 1;
      }
    }
  }
  if (dp[K]) {
    cout << "First" << endl;
  } else {
    cout << "Second" << endl;
  }
}
