#include <bits/stdc++.h>
using namespace std;

using Int = long long;
const char newl = '\n';

template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
template<typename T=Int>
vector<T> read(size_t n){
  vector<T> ts(n);
  for(size_t i=0;i<n;i++) cin>>ts[i];
  return ts;
}


template<typename F>
struct FixPoint : F{
  FixPoint(F&& f):F(forward<F>(f)){}
  template<typename... Args>
  decltype(auto) operator()(Args&&... args) const{
    return F::operator()(*this,forward<Args>(args)...);
  }
};
template<typename F>
inline decltype(auto) MFP(F&& f){
  return FixPoint<F>{forward<F>(f)};
}

//INSERT ABOVE HERE
signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);

  Int n,v;
  cin>>n>>v;
  auto as=read(n);

  vector<Int> dp(1<<n,-1);

  vector<Int> sm(1<<n,0);
  for(Int bit=0;bit<(1<<n);bit++)
    for(Int i=0;i<n;i++)
      if((bit>>i)&1) sm[bit]+=as[i];

  if(sm.back()<=v) drop("Draw");

  MFP([&](auto dfs,Int bit)->Int{
    Int &res=dp[bit];
    if(~res) return res;
    res=0;
    for(Int i=0;i<n;i++){
      if((bit>>i)&1) continue;
      Int nxt=bit|1<<i;
      if(sm[nxt]>v) continue;
      res|=!dfs(nxt);
    }
    return res;
  })(0);

  if(dp[0]==1) drop("First");
  if(dp[0]==0) drop("Second");
  return 0;
}