n, v = map(int, input().split())
A = list(map(int, input().split()))
X = [0]*(1<<n)
for i in range(1<<n):
    s = 0
    for j in range(n):
        if (i>>j)& 1:
            s += A[j]
    X[i] = v-s
dp = [False]*(1<<n)
#print(X)
if X[-1] < 0:
    dp[-1] = True
else:
    print('Draw')
    exit()
for s in reversed(range(2**n-1)):
    if X[s] < 0:
        dp[s] = True
        continue
    v = True
    for j in range(n):
        if not ((s>>j) & 1):
            ns = s | (1<<j)
            v &= dp[ns]
    if v:
        dp[s] = False
    else:
        dp[s] = True
if dp[0]:
    print('First')
else:
    print('Second')