#[allow(unused_imports)]
use std::cmp::{Ordering};

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};

#[allow(unused_imports)]
use std::iter::FromIterator;

#[allow(unused_macros)]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::min($x, min!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::max($x, max!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! get { 
    ([$t: ty]) => { 
        { 
            let mut line = String::new(); 
            stdin().read_line(&mut line).unwrap(); 
            line.split_whitespace().map(|t|t.parse::<$t>().unwrap()).collect::<Vec<_>>()
        }
    };
    ([$t: ty];$n: expr) => {
        (0..$n).map(|_|get!([$t])).collect::<Vec<_>>()
    };
    ($t: ty) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t: ty),*) => {
        { 
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*)
        }
    };
    ($t: ty; $n: expr) => {
        (0..$n).map(|_|get!($t)).collect::<Vec<_>>()
    };
    ($($t: ty),*; $n: expr) => {
        (0..$n).map(|_|get!($($t),*)).collect::<Vec<_>>()
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

const BIG_STACK_SIZE: bool = true;

#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

fn solve() {
    let (x,y,z,kl) = get!(usize, usize, usize, usize);
    let mut a = get!([usize]);
    let mut b = get!([usize]);
    let mut c = get!([usize]);

    a.sort_by(|x1,x2| x2.cmp(&x1));
    b.sort_by(|x1,x2| x2.cmp(&x1));
    c.sort_by(|x1,x2| x2.cmp(&x1));

    let mut heap = BinaryHeap::new();
    let mut added = BTreeSet::new();
    heap.push((a[0]+b[0]+c[0], 0, 0, 0));
    added.insert((a[0]+b[0]+c[0],0,0,0));
    let mut res = Vec::new();
    for t in 0..kl {
        let (mx, i, j, k) = heap.pop().unwrap();
        if i < x-1 {
            let tmp = (a[i+1]+b[j]+c[k], i+1, j, k);
            if !added.contains(&tmp) {
                heap.push(tmp);
                added.insert(tmp);
            }
        }
        if j < y-1 {
            let tmp = (a[i]+b[j+1]+c[k], i, j+1, k);
            if !added.contains(&tmp) {
                heap.push(tmp);
                added.insert(tmp);
            }
        }
        if k < z-1 {
            let tmp = (a[i]+b[j]+c[k+1], i, j, k+1);
            if !added.contains(&tmp) {
                heap.push(tmp);
                added.insert(tmp);
            }
        }
        res.push(mx);
    }
    for e in res.into_iter().take(kl) {
        println!("{}", e);
    }
}


Measured memory_bytes: 8572