#include <bits/stdc++.h> using namespace std; template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;} template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;} using Int = long long; const char newl = '\n'; template<typename ...Ts> decltype(auto) zip(vector<Ts>... args){ vector<decltype(make_tuple(args[0]...))> res; Int n=min({args.size()...}); res.reserve(n); for(Int i=0;i<n;i++) res.emplace_back(args[i]...); return res; } //INSERT ABOVE HERE signed main(){ cin.tie(0); ios::sync_with_stdio(0); Int n,q; cin>>n>>q; vector<Int> xs(n),ws(n); for(Int i=0;i<n;i++) cin>>xs[i]>>ws[i]; { auto zs=zip(xs,ws); sort(zs.begin(),zs.end()); for(Int i=0;i<n;i++) tie(xs[i],ws[i])=zs[i]; } vector<Int> ys(q); for(Int i=0;i<q;i++) cin>>ys[i]; map<Int, Int> idx; for(Int i=0;i<q;i++) idx[ys[i]]=i; vector<Int> zs(ys); sort(zs.begin(),zs.end()); const Int INF = 1e18; vector<Int> res(q,0); for(Int t=0;t<2;t++){ Int sum=0,pre=-INF,tmp=0; for(Int i=0,j=0;i<q;i++){ sum+=(zs[i]-pre)*tmp; pre=zs[i]; while(j<n and xs[j]<=zs[i]){ //cout<<xs[j]<<" "<<ws[j]<<":"<<zs[i]<<endl; //cout<<(zs[i]-xs[j])<<endl; sum+=(zs[i]-xs[j])*ws[j]; tmp+=ws[j]; j++; } // cout<<i<<":"<<sum<<endl; res[i]+=sum; } for(Int i=0;i<n;i++) xs[i]*=-1; for(Int i=0;i<q;i++) zs[i]*=-1; reverse(xs.begin(),xs.end()); reverse(ws.begin(),ws.end()); reverse(zs.begin(),zs.end()); reverse(res.begin(),res.end()); } vector<Int> ans(q); for(Int i=0;i<q;i++) ans[idx[zs[i]]]=res[i]; for(Int a:ans) cout<<a<<newl; return 0; }