#include using namespace std; int main(){ int N, Q; cin >> N >> Q; vector> AW(N); for(int i=0; i> a >> w; AW[i] = {a, w}; } sort(AW.begin(), AW.end()); vector WS(N+1), AWS(N+1); for(int i=0; i> X; int pt = lower_bound(AW.begin(), AW.end(), make_pair(X, int64_t(-1))) - AW.begin(); int64_t s1 = X*WS[pt] - AWS[pt]; int64_t s2 = (AWS[N] - AWS[pt]) - X*(WS[N]-WS[pt]); cout << s1+s2 << endl; } return 0; }