#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,-1,0,1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

//vl dp(1<<20,-1);

int main(){
    ll n,v;cin >> n >> v;
    vl c(n);rep(i,n)cin >> c[i];
    if(v>=accumulate(all(c),0LL))cout << "Draw" <<endl,exit(0);
    vl dp(1<<n);
    /*rep(bit,1<<n){
        ll ret=0;
        rep(i,n){
            if(bit&(1<<i))ret+=c[i];
        }
        if(v<=ret)dp[bit]=0;
    }*/
    //rep(bit,1<<n)cout << dp[bit] <<endl;
    per(bit,1<<n){
        ll ret=0;
        rep(i,n)if(bit&(1<<i))ret+=c[i];
        if(ret>v)continue;
        ll ok=0;
        rep(i,n){
            if(!(bit&(1<<i))){
                ll p=ret+c[i];
                if(p>v)continue;
                if(dp[bit|(1<<i)]==0)ok=1;
            }
        }
        dp[bit]=ok;
    }
    //rep(bit,1<<n)cout << dp[bit] <<endl;
    if(dp[0])cout << "First" <<endl;
    else cout << "Second" <<endl;
    //cout << dp[0] <<endl;
}