#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

int n;
ll v;
ll a[20];

void input(){
    cin >> n >> v;
    for(int i = 0; i < n; i++) cin >> a[i];
}

bool win[1<<20];
ll sum[1<<20];

void process(int i){
    int cnt = 0;
    for(int j = 0; j < n; j++){
        if(i&(1<<j)) {
            cnt++;
            sum[i] += a[j];
        }
    }
    if(sum[i] > v){
        return;
    }
    bool is_first = (cnt%2) == 0;
    for(int j = 0; j < n; j++){
        if(i&(1<<j)) continue;
        int k = i+(1<<j);
        if(sum[k] <= v && win[k] == false){
            win[i] = true;
            return;
        }
    }
    win[i] = false;
}

void solve(){
    ll sum_all = 0;
    for(int i = 0; i < n; i++) sum_all += a[i];
    if(sum_all <= v){
        cout << "Draw" << endl;
        return;
    }
    for(int i = (1<<n)-1; i >= 0; i--){
        process(i);
    }
    if(win[0]){
        cout << "First" << endl;
    }else{
        cout << "Second" << endl;
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    input();
    solve();
}