N,V = map(int,input().split())
A = list(map(int,input().split()))
S = sum(A)
import sys
if S < V:
    print("Draw")
    exit()
sys.setrecursionlimit(10 ** 8 )
dat = [0] * (1 << N)
for bit in range(1,1 << N):
    for i in range(N):
        mask = 1 << i
        if bit & mask:
            dat[bit] = A[i] + dat[bit ^ mask]
            break
from functools import lru_cache
@lru_cache
def calc(S = 0):
    #flag = S.count('1')
    for i in range(N):
        mask = 1 << i
        if S & mask:continue
        if dat[S | mask] > V:continue
        a = calc(S | mask)
        if a == False:return True
    return False
print('First' if calc() else "Second")