#include <bits/stdc++.h>
using namespace std;
long long dp[100000 + 10];
signed main() {
  long long n, k;
  cin >> n >> k;
  long long st[n];
  map<long long, long long> mp;
  for (long long i = 0; i < n; i++) {
    cin >> st[i];
    mp[st[i]] = 1;
  }
  sort(st, st + n);
  for (long long i = 0; i <= 1e5 + 9; i++) {
    if (mp[i] == 1) {
      dp[i] = 1;
    } else if (i < st[0]) {
      dp[i] = 2;
    } else {
      dp[i] = 2;
      for (long long j = 0; j < n; j++) {
        if (dp[i - st[j]] == 2) {
          dp[i] = 1;
          break;
        }
      }
    }
  }
  if (dp[k] == 1) {
    cout << "First";
  } else {
    cout << "Second";
  }
  return 0;
}
