// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

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

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

use std::collections::*;

fn run() {
    input! {
        m: usize,
        n: usize,
        a: [i64; m],
        b: [i64; n],
    }
    let mut z = vec![];
    z.extend(a.iter().map(|a| (*a, 0)));
    z.extend(b.iter().map(|a| (*a, 1)));
    z.sort();
    let inf = 10i64.pow(9) * 2000 + 1;
    for k in 1..=m {
        let k = k as i64;
        let mut left = BinaryHeap::new();
        let mut add = 0;
        let mut ans = 0;
        left.push((0, inf));
        if z[0].1 == 0 {
            add += 1;
        } else {
            add -= k;
        }
        for z in z.windows(2) {
            let diff = z[1].0 - z[0].0;
            let mut d = diff;
            let op = z[1].1;
            while d > 0 && left.peek().map_or(false, |p| p.0 + add > 0) {
                let (a, b) = *left.peek().unwrap();
                let v = b.min(d);
                ans += (a + add) * v;
                d -= v;
                if b == v {
                    left.pop();
                } else {
                    left.peek_mut().unwrap().1 -= v;
                }
            }
            let d = 2 * diff - d;
            if d > 0 {
                left.push((-add, d));
            }
            if op == 0 {
                add += 1;
            } else {
                add -= k;
            }
        }
        for v in left.drain() {
            let pos = v.0 + add;
            let cnt = v.1;
            ans += cnt * std::cmp::max(0, pos - 0);
        }
        println!("{}", ans);
    }
}

fn main() {
    run();
}