1
#include <bits/stdc++.h>
2
using namespace std;
3

4
typedef pair<int, int> PII;
5

6
const int N = 300010;
7

8
int n, m;
9
int a[N], s[N];
10

11
vector<int> alls;
12
vector<PII> add_ops;
13
vector<PII> query_ops;
14

15
int find_index(int x) {
16
    int l = 0;
17
    int r = alls.size() - 1;
18

19
    while (l < r) {
20
        int mid = (l + r) >> 1;
21
        if (alls[mid] >= x) r = mid;
22
        else l = mid + 1;
23
    }
24

25
    return r + 1;
26
}
27

28
int main() {
29
    cin >> n >> m;
30

31
    for (int i = 0; i < n; i++) {
32
        int x, c;
33
        cin >> x >> c;
34
        add_ops.push_back({x, c});
35
        alls.push_back(x);
36
    }
37

38
    for (int i = 0; i < m; i++) {
39
        int l, r;
40
        cin >> l >> r;
41
        query_ops.push_back({l, r});
42
        alls.push_back(l);
43
        alls.push_back(r);
44
    }
45

46
    sort(alls.begin(), alls.end());
47
    alls.erase(unique(alls.begin(), alls.end()), alls.end());
48

49
    for (auto item : add_ops) {
50
        int x = find_index(item.first);
51
        a[x] += item.second;
52
    }
53

54
    for (int i = 1; i <= (int)alls.size(); i++) {
55
        s[i] = s[i - 1] + a[i];
56
    }
57

58
    for (auto item : query_ops) {
59
        int l = find_index(item.first);
60
        int r = find_index(item.second);
61
        cout << s[r] - s[l - 1] << endl;
62
    }
63

64
    return 0;
65
}