#include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
const ll mod=1000000007;
const ll LINF=1ll<<60;
const int INF=1<<30;
int dx[]={1,0,-1,0,1,-1,1,-1};
int dy[]={0,1,0,-1,1,-1,-1,1};




int main(){
    int n;cin >> n;
    ll v;cin >> v;
    vector<ll> a(n);
    ll sum = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        sum += a[i];
    }
    if(sum <= v){
        puts("Draw");
        return 0;
    }
    vector<int> dp(1<<n, -1);
    function<int(int, ll)> f = [&](int bit, ll v){
        if(~dp[bit]) return dp[bit];
        int ret = 0;
        if(v < 0) return dp[bit] = 1;
        for (int i = 0; i < n; i++) {
            if(bit >> i & 1) continue;
            ret |= not f(bit|1LL << i, v - a[i]);
        }
        return dp[bit] = ret;
    };
    if(f(0, v)){
        puts("First");
    }
    else{
        puts("Second");
    }
    return 0;
}