#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    ll M;
    cin >> N >> M;
    vector<ll> A(N);
    for(int i = 0; i < N; ++i)  cin >> A[i];

    auto dfs = [&](auto&& self, int i = 0) -> ll {
        if(i == N)  return 0LL;
        
        if(A[i] == 1)   return A[i] - M - self(self, i + 1);
        else{
            ll take = A[i] - 1;
            A[i] = 1;
            return max(take - self(self, i), 1 - M + self(self, i + 1));
        }
    };

    if(dfs(dfs) > 0)    cout << "First\n";
    else    cout << "Second\n";

    return 0;
}