//
// Created by yamunaku on 2020/10/23.
//

#include <bits/stdc++.h>
//#include <atcoder/all>

using namespace std;
//using namespace atcoder;

#define rep(i, n) for(int i = 0; i < (n); i++)
#define repl(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) for(int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(),(x).end()
#define MOD9 998244353
#define MOD1 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
#define SP <<" "<<
#define CYES cout<<"Yes"<<endl
#define CNO cout<<"No"<<endl
#define CFS cin.tie(0);ios::sync_with_stdio(false)
#define CST(x) cout<<fixed<<setprecision(x)

using ll = long long;
using ld = long double;
using vi = vector<int>;
using mti = vector<vector<int>>;
using vl = vector<ll>;
using mtl = vector<vector<ll>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
template<typename T>
using heap = priority_queue<T, vector<T>, function<bool(const T, const T)>>;

int main() {
    //CFS;
    ll n, v;
    cin >> n >> v;
    vl a(n);
    ll sum = 0;
    rep(i, n) {
        cin >> a[i];
        sum += a[i];
    }
    if (sum <= v) {
        cout << "Draw" << endl;
        return 0;
    }
    vi dp(1 << n, false);
    per(i, 1 << n) {
        sum = 0;
        rep(j, n) {
            if (i & (1 << j)) sum += a[j];
        }
        if (sum > v) {
            dp[i] = true;
            continue;
        }
        dp[i] = true;
        rep(j, n) {
            if (i & (1 << j)) continue;
            if (!dp[i | (1 << j)]) goto next;
        }
        dp[i] = false;
        next:;
    }
    if (dp[0]) cout << "First" << endl;
    else cout << "Second" << endl;
    return 0;
}