from operator import itemgetter
from itertools import *
from bisect import *
from collections import *
from heapq import *
import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
def inval(ni, nj, h, w):
    if ni < 0 or ni >= h or nj < 0 or nj >= w: return True
    return False
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16

n, v = MI()
aa = LI()
if sum(aa)<=v:
    print("Draw")
    exit()
win = [None]*(1 << n)
for bit in range(1 << n):
    if win[bit]!=None:continue
    s = sum(aa[i] for i in range(n) if bit>>i&1==0)
    if s > v:continue
    win[bit]=False
    for i in range(n):
        if bit>>i&1:continue
        win[bit|1<<i]=True

# print(win)
if win[-1]:print("First")
else:print("Second")