#include using namespace std; #define REP(i,n) for(ll i=0;i<(ll)n;i++) #define dump(x) cerr << #x << " = " << (x) << endl; #define spa << " " << #define fi first #define se second #define ALL(a) (a).begin(),(a).end() #define ALLR(a) (a).rbegin(),(a).rend() using ld = long double; using ll = long long; using ull = unsigned long long; using pii = pair; using pll = pair; using pdd = pair; template struct V : vector { using vector::vector; }; V() -> V; V(size_t) -> V; template V(size_t, T) -> V; template vector make_vec(size_t n, T a) { return vector(n, a); } template auto make_vec(size_t n, Ts... ts) { return vector(n, make_vec(ts...)); } template ostream& operator << (ostream& os, const pair v){os << "(" << v.first << ", " << v.second << ")"; return os;} template ostream& operator<<(ostream &os, const vector &v) { for (auto &e : v) os << e << ' '; return os; } template ostream& operator<<(ostream& os, const vector> &v){ for(auto &e : v){os << e << "\n";} return os;} struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; template bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } void fail() { cout << -1 << '\n'; exit(0); } inline int popcount(const int x) { return __builtin_popcount(x); } inline int popcount(const ll x) { return __builtin_popcountll(x); } template void debug(vector>&v,ll h,ll w){for(ll i=0;i void debug(vector&v,ll n){if(n!=0)cerr<> N >> M; assert(N>5); V A(N); REP(i, N) cin >> A[i]; ll tot = 0; REP(i, N) tot += A[i]; tot -= N*M; V> dp(2, V(N+1, -INF)); auto rec = [&](auto self, ll i, ll j)->ll{ if(dp[i][j] != -INF) return dp[i][j]; if(j==N){ dp[i][j] = 0; return 0; } ll res = -INF; if(i==0){ if(A[i]>1) chmax(res, self(self, i, j+1) + A[j] - 1); chmax(res, self(self, 1-i, j+1) + A[j] - M); }else{ ll cand = self(self, 1-i, j+1); if(A[i]>1) chmin(cand, self(self, i, j+1) + 1 - M); res = cand; } // dump(i) // dump(j) // dump(res) // cerr << endl; dp[i][j] = res; return res; }; ll val = rec(rec, 0, 0); // for(auto &v: dp){ // cout << v << endl; // } if(val>tot-val) cout << "First" << endl; else cout << "Second" << endl; return 0; }