#include <bits/stdc++.h>

//#include <atcoder/all>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}

constexpr lint mod = 1000000007;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

int n;
lint v, a[20];
int dp[1 << 20];

int dfs(int S, lint sum) {
    if (dp[S] >= 0) return dp[S];
    dp[S] = 0;
    rep(k, n) if (!(S >> k & 1) && sum + a[k] <= v) {
        if (dfs(S | (1 << k), sum + a[k]) == 0) {
            return dp[S] = 1;
        }
    }
    return dp[S];
}

int main() {
    scanf("%d%lld", &n, &v);
    rep(i, n) scanf("%lld", &a[i]);
    if (accumulate(a, a + n, 0LL) <= v) {
        puts("Draw");
        return 0;
    }
    rep(S, 1 << n) dp[S] = -1;
    puts(dfs(0, 0) ? "First" : "Second");
}