#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
using maxheap = priority_queue<T>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
// const int MOD = 1000000007;
const int MOD = 998244353;

int main() {
    int M, N;
    cin >> M >> N;

    vector<ll> a(M), b(N);
    rep(i, M) cin >> a[i];
    rep(i, N) cin >> b[i];

    vector<ll> xs = a;
    rep(i, N) xs.eb(b[i]);
    rearrange(xs);
    int K = sz(xs);

    vector<int> ca(K, 0), cb(K, 0);
    rep(i, M) ca[lb(xs, a[i])]++;
    rep(i, N) cb[lb(xs, b[i])]++;

    // print(ca), print(cb);

    rep2(t, 1, M + 1) {
        deque<pll> l, r;
        r.emplace_back(0, INF);
        ll add_l = 0, add_r = 0;
        ll tilt_l = 0, tilt_r = 0;
        ll y = 0;
        rep(i, K) {
            // 左に ca[i] 移動
            if (ca[i] > 0) {
                while (!empty(r) && add_r + r.front().first < ca[i]) {
                    auto [x, d] = r.front();
                    r.pop_front();
                    tilt_r += d;
                    l.emplace_back(x + add_r - add_l, d);
                }
                add_l -= ca[i], add_r -= ca[i];
            }
            // 右に cb[i]*t 移動
            if (cb[i] > 0) {
                while (!empty(l) && add_l + l.back().first > -cb[i] * t) {
                    auto [x, d] = l.back();
                    l.pop_back();
                    tilt_r -= d;
                    r.emplace_front(x + add_l - add_r, d);
                }
                add_l += cb[i] * t, add_r += cb[i] * t;
                if (!empty(l)) {
                    ll x = add_l + l.front().first - cb[i] * t;
                    l.front().second += tilt_l;
                    l.emplace_front(x - add_l, 0);
                    tilt_l = 0;
                } else {
                    ll x = add_r + r.front().first - cb[i] * t;
                    if (x >= 0) {
                        r.front().second += tilt_r;
                        r.emplace_front(x - add_r, 0);
                        tilt_l = 0, tilt_r = 0;
                    } else {
                        l.emplace_front(x - add_l, 0);
                        tilt_l = 0;
                        r.front().second += tilt_r;
                        tilt_r = 0;
                    }
                }

                ll x = INF;

                if (!empty(l)) chmin(x, add_l + l.front().first);
                if (!empty(r)) chmin(x, add_r + r.front().first);
                x -= cb[i] * t;
                if (x < 0) {
                    l.emplace_front(x - add_l, tilt_l);
                    tilt_l = 0;
                } else {
                    r.emplace_front(x - add_r, tilt_r);
                    tilt_l = 0, tilt_r = 0;
                }
            }
            // {
            //     cout << i << '\n';
            //     cout << "# " << tilt_l MM tilt_r << '\n';
            //     ll s = tilt_l;
            //     each(e, l) cout << e.first + add_l MM(s += e.second) << '\n';
            //     assert(s == tilt_r);
            //     each(e, r) cout << e.first + add_r MM(s += e.second) << '\n';
            // }
            if (i < K - 1) {
                ll c = xs[i + 1] - xs[i];
                // c|x| を足す
                tilt_r -= c;
                if (!empty(r) && add_r + r.front().first == 0) {
                    r.front().second += 2 * c;
                } else {
                    r.emplace_front(-add_r, 2 * c);
                }
                ll s = tilt_l;
                while (!empty(l) && s + l.front().second <= c) {
                    auto [x, d] = l.front();
                    l.pop_front();
                    s += d;
                    y -= s * (add_l + x);
                    if (!empty(l)) y += s * (add_l + l.front().first);
                }
                tilt_l = s - c;
                if (!empty(l)) {
                    ll x = add_l + l.front().first;
                    y -= c * x;
                }
            }
            // {
            //     cout << i << '\n';
            //     ll s = tilt_l;
            //     each(e, l) cout << e.first + add_l MM(s += e.second) << '\n';
            //     assert(s == tilt_r);
            //     each(e, r) cout << e.first + add_r MM(s += e.second) << '\n';
            // }
        }
        // cout << y << ' ' << tilt_l << ' ';
        ll s = tilt_l;
        while (!empty(l)) {
            auto [x, d] = l.front();
            l.pop_front();
            s += d;
            y -= s * (add_l + x);
            if (!empty(l)) y += s * (add_l + l.front().first);
        }
        cout << y << '\n';
    }
}