n, v = map(int, input().split())
a = list(map(int, input().split()))
if sum(a) <= v:
    print('Draw')
    exit(0)

g = [[] for _ in range(1 << n)]
inv = [0] * (1 << n)
for i in range(1, 1 << n):
    t = 0
    for j in range(n):
        if (i >> j) & 1:
            t += a[j]
    if t <= v:
        for j in range(n):
            if (i >> j) & 1:
                g[i].append(i - (1 << j))
                g[i - (1 << j)].append(i)
                inv[i - (1 << j)] += 1
s = []
for i in range(1 << n):
    if inv[i] == 0:
        s.append(i)
wl = [-1] * (1 << n)
while s:
    p = s.pop()
    for node in g[p]:
        if wl[node] == -1:
            inv[node] -= 1
            if inv[node] == 0:
                s.append(node)
        else:
            if wl[node] == 0:
                wl[p] = 1
    if wl[p] == -1:
        wl[p] = 0
if wl[0] == 0:
    print('Second')
else:
    print('First')