#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;

int main() {
  int n;
  ll v;
  cin >> n >> v;
  vector<ll> a(n);
  rep(i,n) cin >> a[i];
  vector<ll> sum(1 << n, 0);
  for (int i = 0; i < (1 << n); i++) {
    for ( int j = 0; j < n; j++) if (i & (1 << j)) sum[i] += a[j];
  }
  vector<int> dp(1 << n, -1);
  
  auto dfs = [&](auto& f, int s, int t)->int{
    if (sum[s] > v) return 1;
    if (dp[s] != -1) return dp[s];
    dp[s] = 0;
    for (int i = 0; i < n; i++) {
      if (s & (1 << i)) continue;
      int d = f(f, s | (1 << i), t ^ 1);
      dp[s] |= !d;
    }
    return dp[s];
  };

  if (sum[(1 << n)-1] <= v) {
    cout << "Draw" << endl;
  } else {
    cout << (dfs(dfs, 0, 0) ? "First" : "Second") << endl;
  }
  return 0;
}