#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, k;
  cin >> n >> k;
  int arr[n];
  for (int i = 0; i < n; i++) cin >> arr[i];
  vector<int> dp(n, 0);
  for (int i = 1; i <= k; i++) {
    vector<int> ndp(n, 10000000);
    if (i == 1) {
      for (int j = 0; j < n; j++) {
        dp[j] = k - arr[j];
      }
      continue;
    }
    for (int j = 0; j < n; j++) {
      for (int k = 0; k < n; k++) {
        ndp[j] = min(ndp[j], dp[j] - arr[k]);
        if (ndp[j] <= 0) {
          if (i % 2 == 0)
            cout << "Second";
          else
            cout << "First";
          return 0;
        } else if (ndp[j] < 0) {
          if (i % 2 == 0)
            cout << "First";
          else
            cout << "Second";
          return 0;
        }
      }
    }
    dp = ndp;
  }
  return 0;
}
