#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
//n + 2m
const int N = 3e5 + 10;
typedef pair<int, int> PII;
int n, m;
int a[N], s[N];
vector<int> alls;
vector<PII> add, query;
//二分 离散化
int find(int x) {
int l = 0, r = alls.size() - 1;
while (l < r) {
int mid = l + r >> 1;
// alls[mid] >= x 也就是x该插入的位置
if (alls[mid] >= x) r = mid;
else l = mid + 1;
}
return r + 1;//映射到1,2,...
// return r; // 映射到0,1,...
}
int main() {
scanf("%d%d", &n, &m);
while (n--) {
int x, c;
cin >> x >> c;
//在x坐标插上c
add.push_back({x, c});
//alls 待离散的坐标
alls.push_back(x);
}
while (m--) {
int l, r;
cin >> l >> r;
query.push_back({l, r});
alls.push_back(l);
alls.push_back(r);
}
//去重
sort(alls.begin(), alls.end());
alls.erase(unique(alls.begin(), alls.end()), alls.end());
//处理插入
for (auto item : add) {
int x = find(item.first);
a[x] += item.second;
}
//预处理前缀和
for (int i = 1; i <= alls.size(); i++) {
s[i] = s[i - 1] + a[i];
}
//处理询问
for (auto item: query) {
int l = find(item.first), r = find(item.second);
printf("%d\n", s[r] - s[l - 1]);
}
return 0;
}