import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')



proc solve():string=
  var
    n = scan()
    v = scan()
    a = newseqwith(n,scan())
    touch = newseqwith(1.shl(n),false)
    res = newseqwith(1.shl(n),false)
  if a.sum()<=v:
    return "Draw"

  proc dfs(last:int,volume:int):bool=
    if volume<0:
      return true
    if touch[last]:
      return res[last]
    else:
      touch[last] = true

    
    result = false
    # 遷移先がすべて必勝のときのみ必敗
    for i in 0..<n:
      if (last and 1.shl(i))>0:
        result = result or (not dfs(last-1.shl(i),volume-a[i]))
    res[last] = result
    return result
  
  #echo (1.shl(n)-1).toBin(n)
  if dfs(1.shl(n)-1,v):
    return "First"
  else:
    return "Second"


  
echo solve()