#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #ifdef LOCAL # include "debug_print.hpp" # define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else # define debug(...) (static_cast(0)) #endif using namespace std; #define rep(i,n) for(decltype(n) i=0; i<(n); i++) #define rrep(i,n) for(decltype(n) i=(n)-1; i>=0; i--) #define FOR(i,a,b) for(decltype(a) i=(a); i<(b); i++) #define RFOR(i,a,b) for(decltype(b) i=(b-1); i>=(a); i--) #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() #define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() ); #define pb push_back using ll = long long; using D = double; using LD = long double; using P = pair; template using PQ = priority_queue>; template using minPQ = priority_queue, greater>; templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b ostream &operator<<(ostream &os, const pair &p) { os << p.first << " " << p.second; return os; } template istream &operator>>(istream &is, pair &p) { is >> p.first >> p.second; return is; } template ostream &operator<<(ostream &os, const vector &v) { int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template istream &operator>>(istream &is, vector &v) { for (auto &x : v) is >> x; return is; } void in() {} template void in(T &t, U &...u) { cin >> t; in(u...); } void out() { cout << "\n"; } template void out(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; out(u...); } void outr() {} template void outr(const T &t, const U &...u) { cout << t; outr(u...); } int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int n,q; in(n,q); vector> p(n); in(p); sort(ALL(p)); vector ps(n+1); vector x(n), w(n), ws(n+1); rep(i,n) x[i] = p[i].first; rep(i,n) w[i] = p[i].second; rep(i,n) ps[i+1] = ps[i] + x[i] * w[i]; rep(i,n) ws[i+1] = ws[i] + w[i]; while(q--){ ll y; in(y); if(y >= x.back()){ ll ans = y * ws[n] - ps[n]; out(ans); } else{ int idx = upper_bound(ALL(x), y) - x.begin(); ll ans = y * ws[idx] - ps[idx]; ans += (ps[n] - ps[idx]) - y * (ws[n] - ws[idx]); out(ans); } } }