//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 0xcccccccccccccccLL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}



//head



int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	ll v;
	cin >> n >> v;
	vector<ll> a(n);
	rep(i, n) cin >> a[i];
	if(accumulate(all(a), 0LL) <= v) {
		cout << "Draw\n";
		return 0;
	}
	vector<bool> dp(1<<n);
	rep(i, 1<<n) {
		ll sum = 0;
		rep(j, n) if(~i>>j&1) {
			sum += a[j];
		}
		if(sum > v) continue;
		rep(j, n) if(i>>j&1) {
			if(sum+a[j] <= v and !dp[i&~(1<<j)]) dp[i] = true;
		}
	}
	if(dp[(1<<n)-1]) cout << "First\n";
	else cout << "Second\n";
}