"""

ゲームdfs?
2^20

1を勝ち、0を負けとする
1つでも0があったら勝ち

"""

from sys import stdin
import sys
N,V = map(int,stdin.readline().split())
A = list(map(int,stdin.readline().split()))

if sum(A) <= V:
    print ("Draw")
    sys.exit()

ans = [-1] * (2**N)
ans[0] = None
np = [0]
qi = 0

while qi < len(np):
    for j in range(N):
        nex = np[qi] | (1<<j)
        if ans[nex] == -1:
            ans[nex] = None
            np.append(nex)
    qi += 1

np.reverse()


for i in np:

    s = 0
    for j in range(N):
        if (1<<j)&i > 0:
            s += A[j]
    if s > V:
        ans[i] = 1
    else:
        for j in range(N):
            if (1<<j)&i == 0 and ans[(1<<j)|i] == 0:
                ans[i] = 1
                break
        else:
            ans[i] = 0

if ans[0] == 0:
    print ("Second")
else:
    print ("First")