// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;

bool dp[1 << 20];
int main() {
    ll N, V; scanf("%lld%lld", &N, &V);
    vector<ll> A(N);
    for(int i=0; i<N; i++) scanf("%lld", &A[i]);

    if(V - accumulate(A.begin(), A.end(), 0LL) >= 0) {
        puts("Draw");
        return 0;
    }

    for(int bit=(1<<N)-1; bit>=0; bit--) {
        bool exist = false;
        ll rem = V;
        for(int i=0; i<N; i++) {
            if(bit >> i & 1) rem -= A[i];
        }
        for(int i=0; i<N; i++) {
            if(bit >> i & 1) {
                continue;
            }
            exist |= !dp[bit | (1 << i)] and (rem - A[i] >= 0);
        }
        dp[bit] = exist and rem >= 0;
    }
    cout << (dp[0] ? "First" : "Second") << endl;
    return 0;
}