#include <cstdio> #include <cstring> #include <iostream> #include <string> #include <cmath> #include <bitset> #include <vector> #include <map> #include <set> #include <queue> #include <deque> #include <algorithm> #include <complex> #include <unordered_map> #include <unordered_set> #include <random> #include <cassert> #include <fstream> #include <utility> #include <functional> #include <time.h> #include <stack> #include <array> #define popcount __builtin_popcount #define popcountll __builtin_popcountll using namespace std; typedef long long int ll; typedef pair<int, int> P; int main() { int n; ll m; cin>>n>>m; ll a[200020]; for(int i=0; i<n; i++) cin>>a[i]; ll dp[2][200020]; dp[0][n]=dp[1][n]=0; for(int i=n-1; i>=0; i--){ for(int j=0; j<2; j++){ dp[j][i]=a[i]-m-dp[j^1][i+1]; if(a[i]>1){ dp[j][i]=max(dp[j][i], a[i]-2+m+dp[j][i+1]); } if(a[i]>4){ dp[j][i]=max(dp[j][i], a[i]-4-max(4-m-dp[j][i+1], 2+m+dp[j^1][i+1])); } } } if(dp[0][0]>0) cout<<"First"<<endl; else cout<<"Second"<<endl; return 0; }