#include <iostream>
#include <vector>

using lint = long long;

void solve() {
    int n;
    lint v;
    std::cin >> n >> v;

    std::vector<lint> xs(n);
    for (auto& x : xs) std::cin >> x;

    std::vector<int> dp(1 << n, -1);
    auto dfs = [&](auto&& f, int b, lint rem) {
        auto& ret = dp[b];
        if (ret != -1) return ret;

        if (b == (1 << n) - 1) return ret = 1;

        ret = 0;
        for (int i = 0; i < n; ++i) {
            if ((b >> i) & 1) continue;

            auto nrem = rem - xs[i];
            if (nrem < 0) continue;

            ret = std::max(ret, 2 - f(f, b | (1 << i), nrem));
        }
        return ret;
    };

    auto res = dfs(dfs, 0, v);
    std::cout << (res == 0 ? "Second" : res == 1 ? "Draw" : "First") << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}