#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

int main(){
  ll n, v;
  cin >> n >> v;
  vector<ll> a(n);
  ll sum = 0;
  rep(i, n){
    cin >> a.at(i);
    sum += a.at(i);
  }
  if(sum <= v){
    cout << "Draw" << endl;
    return 0;
  }
  vector<bool> b(1 << n);
  rep(bit, 1 << n){
    ll add = 0;
    rep(i, n){
      if((bit & (1 << i)) != 0){
        add += a.at(i);
      }
    }
    if(add > v) b.at(bit) = true;
    else b.at(bit) = false;
  }
  vector<int> dp(1 << n, -1);
  rrep(bit, (1 << n)){
    if(b.at(bit) == false){
      bool f = false;
      rep(i, n){
        if((bit & (1 << i)) == 0){
          int nx = bit + (1 << i);
          if(b.at(nx) == false){
            f = true;
          }
        }
      }
      if(f == false){
        dp.at(bit) = 0;//必敗
      }else{
        dp.at(bit) = 1;
      }
    }
  }
  if(dp.front() == 0) cout << "Second" << endl;
  else cout << "First" << endl;
  return 0;
}