#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const long long INF = 1LL << 60, MAX = 100001;
int N, dp[MAX];
vector<int> S;
bool judge(int a) {
  if (a < S[0])
    return dp[a] = false;
  else {
    bool flag = false;
    for (int i = 0; i < N; i++) {
      if (a - S[i] >= 0 && dp[a - S[i]] != -1) {
        if (!judge(a - S[i])) flag = true;
      } else if (a - S[i] >= 0) {
        if (dp[a - S[i]] == 0) flag = true;
      }
    }
    if (flag)
      return dp[a] = true;
    else
      return dp[a] = false;
  }
}
int main() {
  int K;
  cin >> N >> K;
  for (int i = 0; i < MAX; i++) {
    dp[i] = -1;
  }
  for (int i = 0; i < N; i++) {
    int a;
    cin >> a;
    S.push_back(a);
    dp[a] = 1;
  }
  for (int i = 0; i < S[0]; i++) {
    dp[i] = 0;
  }
  if (judge(K))
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
