#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
#include <cctype>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <utility>
#include <fstream>

using namespace std;
typedef long long ll;
using ull = unsigned long long;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a, T b) { a = abs(a), b = abs(b); while (b > 0) { tie(a, b) = make_pair(b, a % b); } return a; }
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
//constexpr long long mod = 1000000007LL;
constexpr long long mod = 998244353;
constexpr int MAX = 1100000;

int main()
{

	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	ll n, V; cin >> n >> V;
	ll sm = 0;
	vector<ll> a(n); for (int i = 0; i < n; i++) cin >> a[i], sm += a[i];
	if (sm <= V) {
		cout << "Draw" << endl;
		return 0;
	}
	vector<int> dp((1 << n), -1);
	auto dfs = [&](auto &&self, int S)->int {
		if (dp[S] != -1) return dp[S];
		int t = 0;
		ll sm = 0;
		for (int i = 0; i < n; i++) if (S >> i & 1) t ^= 1,sm += a[i];
		if (sm > V) {
			if (t == 0) return dp[S] = 1;
			else return dp[S] = 0;
		}
		if (t == 0) {
			for (int i = 0; i < n; i++) {
				if (!(S >> i & 1)) {

					int f = self(self, S + (1 << i));
					if (f == 1) {
						return dp[S] = 1;
					}
				}
			}
			return dp[S] = 0;
		}
		else {
			for (int i = 0; i < n; i++) {
				if (!(S >> i & 1)) {
					int f = self(self, S + (1 << i));
					if (f == 0) {
						return dp[S] = 0;
					}
				}
			}
			return dp[S] = 1;
		}
	};
	dfs(dfs, 0);
	if (dp[0] == 1) cout << "First" << endl;
	else cout << "Second" << endl;
}