const INF: usize = 1usize << 60;

fn dfs(idx: usize, n: usize, overed: &Vec<bool>, dp: &mut Vec<usize>) -> usize {
    if overed[idx] {
        return 1;
    }
    if dp[idx] < INF {
        return dp[idx];
    }
    for i in 0..n {
        if ((idx >> i) & 1) == 1 {
            continue;
        }
        if dfs(idx | (1 << i), n, overed, dp) == 0 {
            dp[idx] = 1;
            return 1;
        }
    }
    dp[idx] = 0;
    0
}

fn main() {
    let mut nv = String::new();
    std::io::stdin().read_line(&mut nv).ok();
    let nv: Vec<usize> = nv.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let n = nv[0];
    let v = nv[1];
    let mut a = String::new();
    std::io::stdin().read_line(&mut a).ok();
    let a: Vec<usize> = a.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();

    if a.iter().sum::<usize>() <= v {
        println!("Draw");
        return;
    }
    let overed = (0..1<<n).map(|i| (0..n).filter(|&j| ((i >> j) & 1) == 1).map(|j| a[j]).sum::<usize>() > v).collect::<Vec<_>>();
    let mut dp = vec![INF; 1usize << n];
    dfs(0, n, &overed, &mut dp);
    if dp[0] == 0 {
        println!("Second");
    } else {
        println!("First");
    }
}