#include <bits/stdc++.h>

using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

class rep {
    struct Iter {
        usize itr;
        constexpr Iter(const usize pos) noexcept : itr(pos) {}
        constexpr void operator++() noexcept { ++itr; }
        constexpr bool operator!=(const Iter& other) const noexcept {
            return itr != other.itr;
        }
        constexpr usize operator*() const noexcept { return itr; }
    };
    const Iter first, last;

  public:
    explicit constexpr rep(const usize first, const usize last) noexcept
        : first(first), last(std::max(first, last)) {}
    constexpr Iter begin() const noexcept { return first; }
    constexpr Iter end() const noexcept { return last; }
};

template <class T, T Div = 2>
constexpr T INFTY = std::numeric_limits<T>::max() / Div;

template <class T> using Vec = std::vector<T>;

void G_main() {
    usize M, N;
    std::cin >> M >> N;
    Vec<i64> A(M), B(N);
    for (auto& x : A) {
        std::cin >> x;
    }
    for (auto& x : B) {
        std::cin >> x;
    }
    const auto cost = [&](const usize i, const usize j) {
        return std::abs(A[i] - B[j]);
    };
    std::sort(A.begin(), A.end());
    std::sort(B.begin(), B.end());
    Vec<usize> best(M);
    for (const auto i : rep(0, M)) {
        for (const auto j : rep(1, N)) {
            if (cost(i, best[i]) > cost(i, j)) {
                best[i] = j;
            }
        }
    }
    for (const auto k : rep(1, M + 1)) {
        Vec<std::deque<usize>> used(N);
        for (const auto i : rep(0, M)) {
            const auto b = best[i];
            if (used[b].size() < k) {
                used[b].push_back(i);
                continue;
            }
            usize l = b, r = b;
            while (l > 0 && used[l - 1].size() == k) {
                l -= 1;
            }
            while (r < N && used[r].size() == k) {
                r += 1;
            }
            const auto cost_l = [&] {
                if (l == 0) {
                    return INFTY<i64>;
                }
                i64 ret = cost(i, r - 1);
                for (const auto j : rep(l, r)) {
                    ret +=
                        cost(used[j].front(), j - 1) - cost(used[j].front(), j);
                }
                return ret;
            }();
            if (r != N && cost_l > cost(i, r)) {
                used[r].push_back(i);
            } else {
                for (const auto j : rep(l, r)) {
                    used[j - 1].push_back(used[j].front());
                    used[j].pop_front();
                }
                used[r - 1].push_back(i);
            }
        }
        i64 ans = 0;
        for (const auto j : rep(0, N)) {
            for (const auto i : used[j]) {
                ans += cost(i, j);
            }
        }
        std::cout << ans << '\n';
    }
    return;
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    G_main();
    return 0;
}