// Original: https://github.com/tanakh/competitive-rs
#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, [ $t:tt ]) => {
        {
            let len = read_value!($next, usize);
            (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
        }
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_imports)]
use std::cmp::{max, min};
#[allow(unused_imports)]
use std::collections::{BTreeSet, BinaryHeap};

fn main() {
    input!(
        x: usize,
        y: usize,
        z: usize,
        k: usize,
        mut alist: [usize; x],
        mut blist: [usize; y],
        mut clist: [usize; z]
    );

    alist.sort_by(|a, b| b.cmp(&a));
    blist.sort_by(|a, b| b.cmp(&a));
    clist.sort_by(|a, b| b.cmp(&a));

    let mut used = BTreeSet::new();
    let mut heap = BinaryHeap::new();
    let top = alist[0] + blist[0] + clist[0];
    heap.push((top, (0, 0, 0)));

    let mut loop_c = 0;
    while loop_c < k {
        let (target, pos) = heap.pop().unwrap();
        if used.contains(&pos) {
            continue;
        }
        println!("{}", target);
        used.insert(pos);
        loop_c += 1;

        if pos.0 < x - 1 {
            heap.push((
                alist[pos.0 + 1] + blist[pos.1] + clist[pos.2],
                (pos.0 + 1, pos.1, pos.2),
            ));
        }
        if pos.1 < y - 1 {
            heap.push((
                alist[pos.0] + blist[pos.1 + 1] + clist[pos.2],
                (pos.0, pos.1 + 1, pos.2),
            ));
        }
        if pos.2 < z - 1 {
            heap.push((
                alist[pos.0] + blist[pos.1] + clist[pos.2 + 1],
                (pos.0, pos.1, pos.2 + 1),
            ));
        }
    }
}


Measured memory_bytes: 4352