import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))


N,V = MI()
A = LI()
s = sum(A)

if s <= V:
    print('Draw')
    exit()

volume = [0]*(2**N)  # iに対応する硬貨の体積の総和
for i in range(2**N):
    x = 0
    for j in range(N):
        if (i>>j) & 1:
            x += A[j]
    volume[i] = x

dp = [-1]*(2**N)  # dp[i] = iを未使用の硬貨の集合とするとき、先手必勝か否か
for i in range(2**N):
    if s-volume[i] > V:
        continue
    for j in range(N):
        if (i >> j) & 1:
            if dp[i ^ (1 << j)] == 0:
                dp[i] = 1
                break
    else:
        dp[i] = 0

print('First' if dp[-1] == 1 else 'Second')