n, v = map(int, input().split())
A = list(map(int, input().split()))
if sum(A) < v:
    print("Draw")
    exit()
win = [True] * (1 << n)
for bit in range(1 << n):
    tot = 0
    for i in range(n):
        if bit >> i & 1:
            tot += A[i]
    if tot > v:
        win[i] = False
for bit in range((1 << n) - 1, -1, -1):
    if not win[bit]:
        continue
    win[bit] = False
    for i in range(n):
        if not bit >> i & 1:
            nbit = bit | (1 << i)
            if not win[nbit]:
                win[bit] = True
                break
if win[0]:
    print("First")
else:
    print("Second")