#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
template<class T>void chmax(T &a, const T &b) { if (a<b) a=b; }
template<class T>void chmin(T &a, const T &b) { if (b<a) a=b; }
struct Node;
lint N, K;
vector<Node> V;
struct Node {
  int bit;
  lint sum;
  int dfs() {
    int cnt = 0;
    REP(k, N) if(bit>>k&1) cnt++;
    int cnt1 = 0;
    int cntm1 = 0;
    if(cnt%2 == 0) {
      if(sum > K) return 1;
      REP(k, N) if((bit>>k&1) == 0) {
        int ret = V[bit|(1<<k)].dfs();
        if(ret == 1) cnt1++;
        else if(ret == -1) cntm1++;
      }
      if(cnt1 > 0) return 1;
      else if(cnt < N && cntm1 == N-cnt) return -1;
      else return 0;
    } else {
      if(sum > K) return -1;
      REP(k, N) if((bit>>k&1) == 0) {
        int ret = V[bit|(1<<k)].dfs();
        if(ret == 1) cnt1++;
        else if(ret == -1) cntm1++;
      }
      if(cntm1 > 0) return -1;
      else if(cnt < N && cnt1 == N-cnt) return 1;
      else return 0;
    }
    return 0;
  };
};
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> N >> K;
  vector<lint> A(N);
  REP(i, N) cin >> A[i];
  REP(i, 1<<N) {
    V.emplace_back();
    V[i].bit = i;
    REP(k, N) if(i>>k&1) V[i].sum += A[k];
  }
  int ret = V[0].dfs();
  if(ret == 1) cout << "First" << endl;
  else if(ret == -1)cout << "Second" << endl;
  else cout << "Draw" << endl;
}