#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (n); ++i)
#define rrep(i, j, n) for (int i = (n)-1; j <= i; --i)

ll n, v;
bool seen[1 << 20];
bool dfs(int S, vector<ll>& a, vector<bool>& dp) {
  if (seen[S]) return dp[S];
  seen[S] = true;
  ll s = 0;
  rep(i, 0, n) if (S >> i & 1) s += a[i];
  if (s > v) return dp[S] = true;

  bool res = false;
  rep(i, 0, n) if ((S >> i & 1) == 0) res |= !dfs(S | 1 << i, a, dp);

  return dp[S] = res;
}

int main() {
  cin >> n >> v;
  vector<ll> a(n);
  ll s = 0;
  rep(i, 0, n) {
    cin >> a[i];
    s += a[i];
  }

  if (s <= v) {
    cout << "Draw" << endl;
    return 0;
  }
  vector<bool> dp(1 << n);

  if (dfs(0, a, dp))
    cout << "First" << endl;
  else
    cout << "Second" << endl;

  return 0;
}