#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>

using namespace std;
typedef long long ll;

const int MAX_N = 20;

int memo[1 << 20];
ll A[MAX_N];
ll N, V;

int dfs(int n, ll sum, int mask) {
  if (sum > V) {
    return n % 2 == 0;
  }
  if (memo[mask] != -1) return memo[mask];

  int res = n % 2;
  for (int i = 0; i < N; ++i) {
    if (mask >> i & 1) continue;

    int nmask = mask | (1 << i);
    if (n % 2 == 1) {
      res &= dfs(n + 1, sum + A[i], nmask);
    } else {
      res |= dfs(n + 1, sum + A[i], nmask);
    }
  }

  return memo[mask] = res;
}

int main() {
  memset(memo, -1, sizeof(memo));
  cin >> N >> V;

  ll sum = 0;
  for (int i = 0; i < N; ++i) {
    cin >> A[i];
    sum += A[i];
  }

  if (sum <= V) {
    cout << "Draw" << endl;
  } else  if (dfs(0, 0, 0)) {
    cout << "First" << endl;
  } else {
    cout << "Second" << endl;
  }

  return 0;
}