#include "bits/stdc++.h" using namespace std; //#include "atcoder/all" //using namespace atcoder; #define int long long #define REP(i, n) for (int i = 0; i < (int)n; ++i) #define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i) #define FOR(i, s, n) for (int i = s; i < (int)n; ++i) #define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i) #define ALL(a) a.begin(), a.end() #define IN(a, x, b) (a <= x && x < b) templateistream&operator >>(istream&is,vector&vec){for(T&x:vec)is>>x;return is;} templateinline void out(T t){cout << t << "\n";} templateinline void out(T t,Ts... ts){cout << t << " ";out(ts...);} templateinline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;} templateinline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;} constexpr int INF = 1e18; int dp[1ll << 20]; int win[1ll << 20]; int N, V; vector a; int dfs(int bit, int turn) { if(win[bit] != -1) return win[bit]; int v = dp[bit]; if(v > V) { return turn ^ 1; } int ret = 0; REP(i, N) { if(bit & (1ll << i)) continue; ret |= dfs(bit ^ (1ll << i), turn ^ 1) ^ turn; } return win[bit] = ret; } signed main(){ cin >> N >> V; a.resize(N); cin >> a; if(accumulate(ALL(a), 0ll) < V) { out("Draw"); return 0; } REP(i, 1ll << N) { int sum = 0; REP(j, N) { if(i & (1ll << j)) sum += a[j]; } dp[i] = sum; } memset(win, -1, sizeof(win)); dfs(0, 0); if(win[0] == 1) { out("First"); } else { out("Second"); } }