#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

int64_t fast_one(const std::vector<int64_t> &a, const std::vector<int64_t> &b, int k) {
	int n = a.size();
	int m = b.size();
	
	std::deque<int> used[n + 1];
	
	int closest = 0;
	for (int i = 0; i < m; i++) {
		while (closest + 1 < n && std::abs(b[i] - a[closest]) >= std::abs(b[i] - a[closest + 1])) closest++;
		if ((int) used[closest].size() == k) {
			int r = closest;
			int l = closest;
			while (l && (int) used[l - 1].size() == k) l--;
			while (r + 1 < n && (int) used[r + 1].size() == k) r++;
			r++;
			used[r].push_back(i);
			
			int64_t shift_delta = 0;
			for (int j = l; j <= r; j++) shift_delta += std::abs(a[j - 1] - b[used[j][0]]) - std::abs(a[j] - b[used[j][0]]);
			if (shift_delta < 0) {
				for (int j = l; j <= r; j++) {
					used[j - 1].push_back(used[j].front());
					used[j].pop_front();
				}
			}
		} else used[closest].push_back(i);
	}
	int64_t res = 0;
	for (int i = 0; i < n; i++) for (auto j : used[i]) res += std::abs(a[i] - b[j]);
	return res;
}

std::vector<int64_t> fast(std::vector<int> a_, std::vector<int> b_) {
	std::sort(a_.begin(), a_.end());
	std::sort(b_.begin(), b_.end());
	std::vector<int64_t> a(a_.begin(), a_.end());
	std::vector<int64_t> b(b_.begin(), b_.end());
	int n = a.size();
	int m = b.size();
	a.insert(a.begin(), -1000000000000000000);
	a.insert(a.end(), 1000000000000000000);
	b.insert(b.begin(), -1000000000000000000);
	b.insert(b.end(), 1000000000000000000);
	(void) n;
	
	std::vector<int64_t> res;
	for (int i = 1; i <= m; i++) res.push_back(fast_one(a, b, i));
	return res;
}


int main() {
	int m = ri();
	int n = ri();
	std::vector<int> a(m);
	std::vector<int> b(n);
	for (auto &i : a) i = ri();
	for (auto &i : b) i = ri();
	
	auto res = fast(b, a);
	for (auto i : res) printf("%" PRId64 "\n", i);
	
	return 0;
}