#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("First");}else{puts("Second");}
#define MAX_N 200005

int dp[1<<20];
ll n, v;
ll a[30];

int dfs(int x){
    if(dp[x] != -1) return dp[x];
    dp[x] = 0;

    ll sum = 0;
    bitset<20> bi(x);
    rep(i,n){
        if(bi[i]){
            sum += a[i];
        }
    }

    rep(i,n){
        if(bi[i] == 0 && sum + a[i] <= v){
            if(dfs(x+(1<<i)) == 0){
                dp[x] = 1;
                break;
            }
        }
    }

    return dp[x];
}

int main() {
    cin >> n >> v;
    rep(i,n) cin >> a[i];

    ll sum = 0;
    rep(i,n) sum += a[i];
    if(sum <= v){
        cout << "Draw" << endl;
        return 0;
    }

    rep(i,1<<20){
        dp[i] = -1;
    }

    if(dfs(0))yn;

    return 0;
}