#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

const int N = 100010;

vector<int> alls;

int n, m;
int x[N], c[N], l[N], r[N];
int a[N * 3], s[N * 3];

// 找到x在alls中的下标
int find(int x)
{
    int l = 0, r = alls.size() - 1;
    while (l < r)
    {
        int mid = l + r >> 1;
        if (alls[mid] >= x) r = mid;
        else l = mid + 1;
    }
    return r + 1;
}

int main()
{
    scanf("%d%d", &n, &m);

    for (int i = 0; i < n; i ++ )
    {
        scanf("%d%d", &x[i], &c[i]);
        alls.push_back(x[i]);
    }
    for (int i = 0; i < m; i ++ )
    {
        scanf("%d%d", &l[i], &r[i]);
        alls.push_back(l[i]), alls.push_back(r[i]);
    }

    // 排序 + 判重
    sort(alls.begin(), alls.end());
    alls.erase(unique(alls.begin(), alls.end()), alls.end());

    // 插入操作
    for (int i = 0; i < n; i ++ ) a[find(x[i])] += c[i];

    // 预处理前缀和
    for (int i = 1; i <= alls.size(); i ++ ) s[i] = s[i - 1] + a[i];

    // 查询操作
    for (int i = 0; i < m; i ++ ) printf("%d\n", s[find(r[i])] - s[find(l[i]) - 1]);

    return 0;
}