#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
using ll=long long;
typedef pair<int, int> P;

int main()
{
    int n; ll v;
    cin>>n>>v;
    ll a[20];
    for(int i=0; i<n; i++){
        cin>>a[i];
    }
    ll s[1<<20]={};
    for(int i=0; i<(1<<n); i++){
        for(int j=0; j<n; j++){
            if(i&(1<<j)) s[i]+=a[j];
        }
    }
    if(s[(1<<n)-1]<=v){
        cout<<"Draw"<<endl;
        return 0;
    }
    bool dp[1<<20]={};
    for(int i=(1<<n)-1; i>=0; i--){
        if(s[i]>v){
            continue;
        }
        bool dame=1;
        for(int j=0; j<n; j++){
            if(i&(1<<j)) continue;
            if(s[i^(1<<j)]<=v){
                dame=0;break;
            }
        }
        if(dame){
            dp[i]=0; continue;
        }
        for(int j=0; j<n; j++){
            if(i&(1<<j)) continue;
            if(s[i^(1<<j)]>v) continue;
            if(!dp[i^(1<<j)]){
                dp[i]=1; break;
            }
        }
    }
    if(dp[0]) cout<<"First"<<endl;
    else cout<<"Second"<<endl;
    return 0;
}