//离散化：映射+前缀和
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int N = 300010;
int a[N];//计算每个点的值
int s[N];//每个点的前缀和
vector<int>alls;//记录出现过的点的坐标
vector<pair<int,int>>add,query;/*add作为表示添加的值，query作为计算和的值*/
int n,m;
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 l + 1;
}
int main()
{
    cin >> n >> m;
    for(int i = 1;i <= n;i++)
    {
        int x,c;
        cin >> x >> c;
        add.push_back({x,c});
        alls.push_back(x);
    }
    for(int i = 1;i <= m;i++)
    {
        int x,c;
        cin >> x >> c;
        query.push_back({x,c});
        alls.push_back(x);
        alls.push_back(c);
    }
    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] += a[i] + s[i - 1];
    }
    for(auto item:query)
    {
        int l = find(item.first),r = find(item.second);
        cout << s[r] - s[l - 1] << endl;
    }
    return 0;
}