#include <bits/stdc++.h>
#include <atcoder/all>

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

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();
	
	std::vector<std::pair<int, int> > seq;
	for (int j = 0; j < m; j++) seq.push_back({a[j], j + 1});
	for (int j = 0; j < n; j++) seq.push_back({b[j], j + m + 1});
	std::sort(seq.begin(), seq.end());
	
	for (int i = 1; i <= m; i++) {
		atcoder::mcf_graph<int, int64_t> graph(n + m + 2);
		for (int j = 0; j < m; j++) graph.add_edge(0, j + 1, 1, 0);
		for (int j = 0; j < n; j++) graph.add_edge(j + m + 1, n + m + 1, i, 0);
		for (int j = 0; j + 1 < (int) seq.size(); j++) {
			graph.add_edge(seq[j].second, seq[j + 1].second, 1000000000, seq[j + 1].first - seq[j].first);
			graph.add_edge(seq[j + 1].second, seq[j].second, 1000000000, seq[j + 1].first - seq[j].first);
		}
		printf("%" PRId64 "\n", graph.flow(0, n + m + 1).second);
		
	}
	
	return 0;
}