#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
const long long mod = 1e9 + 7;
using namespace std;
long long n, x, k;
bool dp[10005];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  long long a[k + 2];
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int stones = 0; stones <= k; stones++) {
    for (int x = 1; x <= n; x++) {
      if (stones >= a[x] && dp[stones - a[x]] == 0) {
        dp[stones] = true;
        break;
      }
    }
  }
  if (dp[k] == true) {
    cout << "First";
  } else
    cout << "Second";
}
