#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
const int nax = 100005;
const long M = 1000000007;
long long dp[105][nax];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t;
  t = 1;
  while (t--) {
    long long n, k;
    cin >> n >> k;
    int arr[n];
    for (int i = 0; i < n; i++) {
      cin >> arr[i];
    }
    for (int stones = 1; stones <= n; stones++) {
      for (int val = 1; val <= k; val++) {
        dp[stones][val] = dp[stones][val] || dp[stones - 1][val];
        if (arr[stones - 1] <= val && !dp[stones][val - arr[stones - 1]]) {
          dp[stones][val] = 1;
        }
      }
    }
    if (dp[n][k] == 1) {
      cout << "First" << endl;
    } else {
      cout << "Second" << endl;
    }
  }
}
