#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int N, K;
int dp[101010][2], A[111];
int main() {
  cin >> N >> K;
  int mi = 101010, ma = 0;
  for (int i = 0; i < (N); i++) {
    cin >> A[i];
    mi = min(mi, A[i]);
    ma = max(ma, A[i]);
  }
  for (int i = 0; i < (K + 1); i++)
    for (int j = 0; j < (2); j++) {
      if (i < mi) continue;
      if (i <= ma) {
        dp[i][j] = 1;
        continue;
      }
      for (int k = 0; k < (N); k++) dp[i][j] |= !dp[i - A[k]][(j + 1) % 2];
    }
  cout << (dp[K][0] ? "First" : "Second") << endl;
  return 0;
}
