import sys
input = sys.stdin.readline
from collections import *

class BIT:
    def __init__(self, n):
        self.n = n
        self.bit = [0]*(n+1)
    
    def add(self, i, x):
        i += 1
        
        while i<=self.n:
            self.bit[i] += x
            i += i&(-i)
    
    def update(self, i, x):
        self.add(i, -self.acc(i+1)+self.acc(i))
        self.add(i, x)

    def acc(self, i):
        s = 0
        
        while i>0:
            s += self.bit[i]
            i -= i&(-i)
        
        return s
    
    def get(self, l, r):
        return self.acc(r)-self.acc(l)

N = int(input())
AT = [tuple(map(int, input().split())) for _ in range(N)]
updates = []

for i in range(N):
    A, T = AT[i]
    updates.append((T-1, i, -1, A+T-1))
    updates.append((T+A, i, 0, 0))

updates.sort()
Q = int(input())
DLRI = []

for i in range(Q):
    D, L, R = map(int, input().split())
    DLRI.append((D, L, R, i))

DLRI.sort()

ans = [-1]*Q
idx = 0
bit1 = BIT(N)
bit2 = BIT(N)

for i in range(N):
    bit2.add(i, AT[i][0])

for D, L, R, I in DLRI:
    while idx<2*N and updates[idx][0]<=D:
        bit1.update(updates[idx][1], updates[idx][2])
        bit2.update(updates[idx][1], updates[idx][3])
        idx += 1
    
    a = bit1.acc(R)-bit1.acc(L-1)
    b = bit2.acc(R)-bit2.acc(L-1)
    ans[I] = a*D+b

for i in range(Q):
    print(ans[i])