#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

int N;
ll V;
vector<ll> A;

int dp[(1<<20)];

int solve(int state){
  if(dp[state]!=-1) return dp[state];
  {
    ll sum=0;
    rep(i,N) if((state&(1<<i))==0) sum+=A[i];
    if(sum>V) return dp[state]=1; 
  }

  for(int i=0;i<N;i++){
    if((state&(1<<i))==0) continue;
    int res=solve(state^(1<<i));
    if(res==0) return dp[state]=1;
  }
  return dp[state]=0;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  cin>>N>>V;
  A.resize(N);
  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<<N)) dp[i]=-1;
  int ans=solve((1<<N)-1);

  if(ans) cout<<"First"<<endl;
  else cout<<"Second"<<endl;

  return 0;
}