n, v = map(int, input().split())
A = list(map(int, input().split()))

if sum(A) <= v:
    print('Draw')

A.sort()
from collections import deque
A = deque(A)
for i in range(n):
    if i != n-1:
        if A[-1] <= v:
            v -= A[-1]
            A.pop()
        else:
            if v-A[0] < 0:
                if i%2 == 0:
                    print('Second')
                    exit()
                else:
                    print('First')
                    exit()
            else:
                v -= A[0]
                A.popleft()
    else:
        if v-A[0] < 0:
            if i%2 == 0:
                print('Second')
                exit()
            else:
                print('First')
                exit()