#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int Mod = 1000000007;
const int INF = 0x3f3f3f3f;
const long long LL_INF = 0x3f3f3f3f3f3f3f3f;
const double e = exp(1);
const double PI = acos(-1);
const double ERR = 1e-10;
int a[105];
int dp[maxn][105];
int minn[maxn];
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  int answer = 0;
  memset(minn, 0, sizeof(minn));
  minn[0] = k;
  for (int i = 1; i <= 100000; i++) {
    for (int j = 1; j <= n; j++) {
      dp[i][j] = minn[i - 1] - a[j];
      if (dp[i][j] < a[1]) {
        answer = i;
        break;
      }
      minn[i] = max(minn[i], dp[i][j]);
    }
    if (answer) break;
  }
  if (answer & 1)
    printf("First\n");
  else
    printf("Second\n");
  return 0;
}
