#include<bits/stdc++.h> using namespace std; #define ALL(x) x.begin(),x.end() #define rep(i,n) for(int i=0;i<(n);i++) #define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl; #define INF 1000000000 #define mod 1000000007 using ll=long long; const ll LINF=1001002003004005006ll; int dx[]={1,0,-1,0}; int dy[]={0,1,0,-1}; ll gcd(ll a,ll b){return b?gcd(b,a%b):a;} template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;} template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;} signed main(){ cin.tie(0); ios::sync_with_stdio(0); int n,q;cin>>n>>q; vector<ll> x(n),w(n); rep(i,n) cin>>x[i]>>w[i]; vector<ll> sumw(n+1,0),sumxw(n+1,0); rep(i,n){ sumw[i+1]=sumw[i]+w[i]; sumxw[i+1]=sumxw[i]+x[i]*w[i]; } while(q--){ int p;cin>>p; int k=lower_bound(ALL(x),p)-x.begin(); ll ans=0; ans+=p*sumw[k]; ans-=p*(sumw[n]-sumw[k]); ans-=sumxw[k]; ans+=sumxw[n]-sumxw[k]; cout<<ans<<endl; } return 0; }