#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unrolled-loops")
using namespace std;
const long long mod = 1e9 + 7;
int test = 1;
int n, k;
int a[110];
int dp[100100];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1, a + n + 1);
  memset(dp, 0, sizeof(dp));
  for (int i = 1; i <= k; i++) {
    for (int j = 1; j <= n; j++) {
      if ((i - a[j] >= 0)) {
        dp[i] = dp[i - a[j]] + 1;
      }
    }
  }
  for (int i = k - a[1] + 1; i <= k; i++) {
    if (dp[i] != 0) {
      if (dp[i] % 2)
        cout << "First";
      else
        cout << "Second";
      return 0;
    }
  }
}
