#include <iostream>
#include<bits/stdc++.h>


using namespace std;

int main() {
	// your code goes here
	int n;
	cin>>n;
	int q;
	cin>>q;
	vector<int> price(n),query(q);
	for(int i=0;i<n;i++){
		cin>>price[i];
	}
	for(int i=0;i<q;i++){
		cin>>query[i];
	}
	
		sort(price.begin(),price.end());
	
	vector<int> prefix(n+1,0);
	for(int i=1;i<=n;i++){
		prefix[i]=prefix[i-1] + price[i-1];
		
	}
	

	for(int i=0;i<q;i++){
		int target = query[i];
		int left_part_idx = upper_bound(price.begin(),price.end(),target)-price.begin();
		int left_sum = target*(left_part_idx) - prefix[left_part_idx];
		int right_sum = prefix[n] - prefix[left_part_idx] - target*(n-left_part_idx);
		cout<<left_sum + right_sum<<endl;
		
	}
	return 0;
}