#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
#include<queue>

using namespace std;

#define int long long
#define endl "\n"

constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007; 

struct fast_io {
	fast_io(){
		std::cin.tie(nullptr);
		std::ios::sync_with_stdio(false);
	};
} fio;

#define x first
#define w second

signed main(){
	cout<<fixed<<setprecision(10);
	
	int N, Q, sum2 = 0;
	int sumw1 = 0, sumw2 = 0;
	vector<pair<int,int>> in;
	vector<pair<int,int>> X;
	
	cin>>N>>Q;
	
	in.resize(N);
	X.resize(Q);
	
	for(int i = 0; i < N; i++){
		cin>>in[i].x>>in[i].w;
		sum2 += in[i].x * in[i].w;
		sumw2 += in[i].w;
	}
	
	sort(in.begin(), in.end());
	
	for(int i = 0; i < Q; i++){
		cin>>X[i].first;
		X[i].second = i;
	}
	
	sort(X.begin(), X.end());
	
	
	for(int i = 0, j = 0, con = 0, sum = 0, con2 = N; i < Q; i++){
		for(; j < N; j++){
			if(in[j].x >= X[i].first) break;
			con++;
			con2--;
			sumw2 -= in[j].w;
			sumw1 += in[j].w;
			sum2 -= in[j].x * in[j].w;
			sum += in[j].x * in[j].w;
		}
		X[i].first = (X[i].first * sumw1 - sum) + (sum2 - X[i].first * sumw2);
		
		swap(X[i].first, X[i].second);
	}
	
	sort(X.begin(), X.end());
	
	for(int i = 0; i < Q; i++){
		cout<<X[i].second<<endl;
	}
	
	return 0;
}