n, v = map(int, input().split())
a = list(map(int, input().split()))
if sum(a) <= v:
    exit(print("Draw"))
dp = [-1] * (1 << n)
def dfs(S, t):
    if t > v:
        dp[S] = 0
        return 0
    if dp[S] != -1:
        return dp[S]
    res = 0
    for i in range(n):
        if (1 << i) & S:
            continue
        res |= dfs((1 << i) | S, t + a[i])
    dp[S] = (not res)
    return (not res)
if dfs(0, 0):
    print("Second")
else:
    print("First")