#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
 
template<class T> inline bool chmax(T &a, T b){
    if(a<b){
        a = b;
        return true;
    }
    return false;
}

template<class T> inline bool chmin(T &a, T b){
    if(a>b){
        a = b;
        return true;
    }
    return false;
}
ll val[1<<20];
int res[1<<20];
int main(){
    ll n,v;
    cin >> n >> v;
    vector<ll> a(n);
    rep(i,n) cin >> a[i];
    rep(i,1<<n){
        rep(j,n){
            if((i>>j)&1){
                val[i] += a[j];
            }
        }
        if(val[i] > v){
            res[i] = -1;
        }
    }
    if(res[(1<<n)-1]==0){
        cout << "Draw" << endl;
        return 0;
    }
    for(int bits = (1<<n)-1;bits>=0;bits--){
        if(res[bits]==-1)continue;
        bool ok = 0;
        rep(i,n){
            if(((bits>>i)&1)==0){
                int k = (bits)^(1<<i);
                if(res[k]==0){
                    ok = 1;
                }
            }
        }
        res[bits] = ok;
    }
    if(res[0]){
        cout << "First" << endl;
    }else{
        cout << "Second" << endl;
    }
    return 0;
}