N,V = map(int,input().split())
A = list(map(int,input().split()))
A.sort(reverse = True)
if sum(A) <= V:
    print("Draw")
    exit()

allb = (1<<N)-1
X = [0] * (allb + 1)
for i in range(allb + 1):
    x = i ^ allb
    t1 = V
    for j in range(N):
        if x & (1<<j):
            t1 -= A[j]
    X[i] = t1

from functools import lru_cache
@lru_cache(maxsize=1050000)
def f(x):
    #if X[x] < 0:
    #    return True
    for i in range(N):
        if x & (1<<i):
            if X[x] - A[i] < 0:
                continue
            if not(f(x ^ (1<<i))):
                return True
    return False

if f(allb):
    print("First")
else:
    print("Second")