#include <bits/stdc++.h>
using namespace std;
const long long int mod = 998244353;
void __print(long long int x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  long long int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
long long int solve(vector<long long int> &arr, long long int n,
                    long long int k) {
  vector<long long int> dp(k + 1, 0);
  long long int mini = *min_element(arr.begin(), arr.end());
  for (long long int i = mini + 1; i <= k; i++) {
    for (long long int j = 1; j <= n; j++) {
      if (arr[j] > i) break;
      if (dp[i - arr[j]] == 0) {
        dp[i] = 1;
      }
    }
  }
  if (dp[k]) {
    cout << "First" << endl;
  } else {
    cout << "Second" << endl;
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, k;
  cin >> n >> k;
  vector<long long int> arr(n + 1);
  for (long long int i = 1; 1 < n + 1 ? i < n + 1 : i > n + 1;
       1 < n + 1 ? i += 1 : i -= 1) {
    cin >> arr[i];
  }
  solve(arr, n, k);
}
