// #include <atcoder/all>
// using namespace atcoder;
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define rrep(i, n) for (int i = (int)n-1; i >= 0; --i)
using namespace std;
using ll = long long;
template<typename T>
inline bool chmax(T& a, const T& b) {
    if (a < b){
        a = b;
        return true;
    }
    return false;
}
template<typename T>
inline bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
/**
 * @brief 多次元 vector の作成
 * @author えびちゃん
 */
namespace detail {
    template<typename T, int N>
    auto make_vec(vector<int>& sizes, T const& x) {
        if constexpr (N == 1) {
            return vector(sizes[0], x);
        } else {
            int size = sizes[N-1];
            sizes.pop_back();
            return vector(size, make_vec<T, N-1>(sizes, x));
        }
    }
}
template<typename T, int N>
auto make_vec(int const(&sizes)[N], T const& x = T()) {
    vector<int> s(N);
    for (int i = 0; i < N; ++i) s[i] = sizes[N-i-1];
    return detail::make_vec<T, N>(s, x);
}
__attribute__((constructor))
void fast_io() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

int main() {
    int n;
    ll v;
    cin >> n >> v;
    vector<ll> a(n);
    rep(i, n) cin >> a[i];
    ll sum = accumulate(a.begin(), a.end(), 0LL);
    if (sum <= v) {
        cout << "Draw\n";
        return 0;
    }
    vector<bool> win(1<<n);
    for (int bit = (1<<n) - 1; bit >= 0; --bit) {
        ll now = 0;
        rep(i, n) if (bit >> i & 1) now += a[i];
        if (now >= v) continue;
        bool res = false;
        rep(i, n) if (!(bit >> i & 1) && now + a[i] <= v) {
            int nbit = bit | (1 << i);
            if (!win[nbit]) {
                res = true;
                break;
            }
        }
        win[bit] = res;
    }
    cout << (win[0] ? "First" : "Second") << '\n';
}