#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define logn long
#define lnog long
#define lgon long
#define itn int
const long long INF = 1e15;
template <typename T>
void input_arr(vector<T>& A, long long N) {
    for (long long i = 0; i < N; i++) {
        cin >> A[i];
    }
}
long long ans(const vector<long long>& A, const vector<long long>& B, long long i) {
    long long N = A.size(), M = B.size();
    deque<long long>used[N + 1];
    long long closest = 0;
    for (long long j = 0; j < M; j++) {
        while (closest + 1 < N && abs(B[j] - A[closest]) >= abs(B[j] - A[closest + 1])) {
            closest++;
        }
        if (used[closest].size() == i) {
            long long right = closest, left = closest;
            while (left != 0 && used[left - 1].size() == i) left--;
            while (right + 1 < N && used[right + 1].size() == i) right++;
            right++;
            used[right].push_back(j);

            long long change = 0;
            for (long long k = left; k <= right; k++) {
                change += abs(A[k - 1] - B[used[k][0]]) - abs(A[k] - B[used[k][0]]);
            }
            if (change < 0) {
                for (long long k = left; k <= right; k++) {
                    used[k - 1].push_back(used[k].front());
                    used[k].pop_front();
                }
            }
        }
        else {
            used[closest].push_back(j);
        }
    }
    long long ans = 0;
    for (long long j = 0; j < N; j++) {
        for (long long k = 0; k < used[j].size(); k++) {
            ans += abs(A[j] - B[used[j][k]]);
        }
    }
    return ans;
}
int main() {
    long logn M, N; cin >> M >> N;
    vector<long long>A(M), B(N); input_arr(A, M); input_arr(B, N);
    sort(A.begin(), A.end());
    sort(B.begin(), B.end());
    assert(1 <= N && N <= 2000);
    assert(1 <= M && M <= N);
    for (long long i = 0; i < M; i++) {
        assert(1 <= A[i] && A[i] <= 1000000000);
    }
    for (long long i = 0; i < N; i++) {
        assert(1 <= B[i] && B[i] <= 1000000000);
    }
    vector<long long>C(A.begin(), A.end());
    vector<long long>D(B.begin(), B.end());
    C.insert(C.begin(), INF * (-1)); C.insert(C.end(), INF);
    D.insert(D.begin(), INF * (-1)); D.insert(D.end(), INF);
    for (long long i = 1; i <= M; i++) {
        cout << ans(D, C, i) % INF << endl;
    }
}