class SegmentTree(object):
    def __init__(self, A, dot, unit):
        n = 1 << (len(A) - 1).bit_length()
        tree = [unit] * (2 * n)
        for i, v in enumerate(A):
            tree[i + n] = v
        for i in range(n - 1, 0, -1):
            tree[i] = dot(tree[i << 1], tree[i << 1 | 1])
        self._n = n
        self._tree = tree
        self._dot = dot
        self._unit = unit

    def __getitem__(self, i):
        return self._tree[i + self._n]

    def update(self, i, v):
        i += self._n
        self._tree[i] = v
        while i != 1:
            i >>= 1
            self._tree[i] = self._dot(self._tree[i << 1], self._tree[i << 1 | 1])

    def add(self, i, v,ope):
        self.update(i, ope(self[i],v))

    def sum(self, l, r): #これで[l,r)から取り出す。
        l += self._n
        r += self._n
        l_val = r_val = self._unit
        while l < r:
            if l & 1:
                l_val = self._dot(l_val, self._tree[l])
                l += 1
            if r & 1:
                r -= 1
                r_val = self._dot(self._tree[r], r_val)
            l >>= 1
            r >>= 1
        return self._dot(l_val, r_val)
from collections import defaultdict
N = int(input())
A = []
T = []
for _ in range(N):
    a,t = map(int,input().split())
    A.append(a)
    T.append(t)
Q = int(input())
memo = defaultdict(list)
board = []
for i in range(N):
    memo[T[i]].append((-1,i))
    memo[T[i] + A[i]].append((0,i))
for q in range(Q):
    d,l,r = map(int,input().split())
    l-=1
    r-=1
    memo[d].append((1,q))
    board.append((l,r))
ANS = [0] * Q
keys = list(memo.keys())
keys.sort()
segcnt = SegmentTree([0] * N,lambda x,y:x+y,0)
segsum = SegmentTree([0] * N ,lambda x,y:x+y,0)
Aseg = SegmentTree(A,lambda x,y:x+y,0)
for key in keys:
    memo[key].sort()
    for t,index in memo[key]:
        if t == -1:
            segcnt.update(index,1)
            segsum.update(index,-(key-1))
        elif t == 0:
            segcnt.update(index,0)
            segsum.update(index,0)
            Aseg.update(index,0)
        else:
            l,r = board[index]
            ans = Aseg.sum(l,r+1) - (segcnt.sum(l,r+1) * key + segsum.sum(l,r+1))
            ANS[index] = ans
print(*ANS,sep='\n')