#include<bits/stdc++.h>
//#include<atcoder/all>

using namespace std;
//using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007

ll n,V;
vector<int> dp(1 << 21,-1);
bool dfs(vector<ll> &a,int msk){
  if(dp[msk] != -1)return dp[msk];
  ll sum = 0;
  rep(i,n)if(msk >> i & 1)sum += a[i];
  bool is = true;
  rep(i,n)if(!(msk >> i & 1) && sum+a[i] <= V)is &= dfs(a,msk | 1 << i);
  return dp[msk] = !is;
}

int main(){
  
  cin >> n >> V;
  vector<ll> a(n);
  ll s = 0;
  rep(i,n)cin >> a[i],s += a[i];
  if(s <= V){
    cout << "Draw\n";
    return 0;
  }
  cout << (dfs(a,0) ? "First\n" : "Second\n");
  


  return 0;
}