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

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    ll V;
    cin >> N >> V;
    vector<ll> A(N);
    for(int i = 0; i < N; ++i)  cin >> A[i];
    
    vector<ll> S(1 << N, V);
    for(int mask = 0; mask < 1 << N; ++mask){
        for(int i = 0; i < N; ++i){
            if(mask >> i & 1)   S[mask] -= A[i];
        }
    }
    if(S[(1 << N) - 1] >= 0){
        cout << "Draw\n";
        return 0;
    }

    vector<int> dp(1 << N, -1);
    auto func = [&](auto&& self, int mask) -> int {
        if(dp[mask] != -1)  return dp[mask];
        if(S[mask] < 0) return dp[mask] = 1;
        int res = 1;
        for(int i = 0; i < N; ++i){
            if(mask >> i & 1)   continue;
            res &= self(self, mask | (1 << i));
        }
        res ^= 1;
        return dp[mask] = res;
    };
    if(func(func, 0))   cout << "First\n";
    else    cout << "Second\n";
    
    return 0;
}