#include <bits/stdc++.h>
 
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {os << "["; for (const auto &v : vec) {os << v << ","; } os << "]"; return os;}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) {os << "(" << p.first << ", " << p.second << ")"; return os;}
 
int N; ll V;
vector<ll> A;
vector<int> dp;

int f(int bit) {
    if (dp[bit] != -1) return dp[bit];
    int turn = __builtin_popcount(bit) % 2;
    ll sum = 0;
    for(int i = 0; i < N; i++) {
        if (bit >> i & 1) {
            sum += A[i];
        }
    }
    if (sum > V) {
        return dp[bit] = 1 - turn;
    }
    for (int i = 0; i < N; i++) {
        if (!(bit >> i & 1)) {
            if (sum + A[i] <= V) {
                int ret = f(bit | (1 << i));
                if (ret == turn) return dp[bit] = turn;
            }
        }
    }
    return dp[bit] = 1 - turn;
}

void solve() {
    cin >> N >> V;
    for (int i = 0; i < N; i++) {
        int a; cin >> a;
        A.push_back(a);
    }
    ll sum = 0;
    for (int i = 0; i < N; i++) {
        sum += A[i];
    }
    if (sum <= V) {
        cout << "Draw" << endl;
        return;
    }

    dp.resize(1 << N, -1);
    int ans = f(0);
    if (ans == 0) {
        cout << "First" << endl;
    } else {
        cout << "Second" << endl;
    }
}

int main() {
    #ifdef LOCAL_ENV
    cin.exceptions(ios::failbit);
    #endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout.setf(ios::fixed);
    cout.precision(16);
    
    solve();
}