#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomanip>
#include <functional>
#include <cassert>
using namespace std;

using ll=long long;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define ALL(v) v.begin(),v.end()
template < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }
template < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }
#define DEBUG_VLL(vec) for(int sz=0;sz<int(vec.size());sz++) std::cerr<<vec[sz]<<(sz==int(vec.size())-1?'\n':' ');

const long long MOD = 1000000007;
const long long HIGHINF = (long long)1e18;
const int INF = (int)1e9;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n; ll v; cin >> n >> v;
    vll a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    if (accumulate(ALL(a), 0LL) <= v) {
        cout << "Draw\n";
        return 0;
    }

    V<int> dp(1 << n, -1);
    auto memo = [&](auto && self, int state, ll sum) -> bool {
        if (dp[state] != -1) return dp[state];
        if (sum > v) return dp[state] = 1;
        int tmp = 1;
        for (int i = 0; i < n; i++) {
            if (state >> i & 1) continue;
            tmp = tmp & self(self, state | (1 << i), sum + a[i]);
        }
        return (dp[state] = tmp ^ 1);
    };

    if (memo(memo, 0, 0)) cout << "First\n";
    else cout << "Second\n";
    return 0;
}