#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(),(x).end()
#define inf 1e18

using namespace std;

typedef long long llint;
typedef pair<llint, llint> P;

llint n, v;
llint a[25];
bool dp[1<<20];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> v;
	for(int i = 0; i < n; i++) cin >> a[i];
	
	llint sum = 0;
	for(int i = 0; i < n; i++) sum += a[i];
	if(sum <= v){
		cout << "Draw" << endl;
		return 0;
	}
	
	llint N = 1<<n;
	for(int i = N-1; i >= 0; i--){
		llint sum = 0;
		for(int j = 0; j < n; j++){
			if(i & (1<<j)) sum += a[j];
		}
		if(sum > v) dp[i] = true;
		for(int j = 0; j < n; j++){
			if((i & (1<<j)) == 0) dp[i] |= !dp[i|(1<<j)];
		}
	}
	
	if(dp[0]) cout << "First" << endl;
	else cout << "Second" << endl;
	
	return 0;
}