class SegTree: """ define what you want to do with 0 index, ex) size = tree_size, func = min or max, sta = default_value """ def __init__(self,size,func,sta): self.n = size self.size = 1 << size.bit_length() self.func = func self.sta = sta self.tree = [sta]*(2*self.size) def build(self, list): """ set list and update tree""" for i,x in enumerate(list,self.size): self.tree[i] = x for i in range(self.size-1,0,-1): self.tree[i] = self.func(self.tree[i<<1],self.tree[i<<1 | 1]) def set(self,i,x): i += self.size self.tree[i] = x while i > 1: i >>= 1 self.tree[i] = self.func(self.tree[i<<1],self.tree[i<<1 | 1]) def get(self,l,r): """ take the value of [l r) with func (min or max)""" l += self.size r += self.size res = self.sta while l < r: if l & 1: res = self.func(self.tree[l],res) l += 1 if r & 1: res = self.func(self.tree[r-1],res) l >>= 1 r >>= 1 return res def max_right(self, l, x): """[l,r) が ok であるような最大の r を返す""" if l == self.n: return l l += self.size res = self.sta check = True while check or (l & -l) != l: check = False while l%2 == 0: l >>= 1 if not self.func(res,self.tree[l]) < x: while l < self.size: l <<= 1 if self.func(res,self.tree[l]) < x: res = self.func(res,self.tree[l]) l += 1 return l - self.size res = self.func(res,self.tree[l]) l += 1 return self.n def min_left(self, r, x): """(r が ok であるような最小の r を返す probably wrong""" if r == 0: return 0 r += self.size res = self.sta check = True while check and (r & -r) != r: check = False r -= 1 while (r > 1 and r%2): r >>= 1 if not self.func(res, self.tree[r]) < x: while r < self.size: r = 2*r + 1 if self.func(res, self.tree[r]) < x: res = self.func(res, self.tree[r]) r -= 1 return r + 1 - self.size res = self.func(self.tree[r],res) return 0 def func(x,y): return x+y n = int(input()) AT = [list(map(int,input().split())) for i in range(n)] A = [a for a,t in AT] q = int(input()) DLR = [list(map(int,input().split())) for i in range(q)] ans = [0]*q event = [] for i,(a,t) in enumerate(AT): if a == 0: continue event.append([t,-1,i,0]) event.append([t+a,-2,i,0]) for i,(d,l,r) in enumerate(DLR): event.append([d,i,l,r]) seg1 = SegTree(n,func,0) seg3 = SegTree(n,func,0) seg4 = SegTree(n,func,0) seg1.build([a for a,t in AT]) event.sort() for day,ind,x,y in event: if ind == -1: seg3.set(x,1) seg4.set(x,day) elif ind == -2: seg1.set(x,0) seg3.set(x,0) seg4.set(x,0) else: l,r = x-1,y count = seg1.get(l,r) -seg3.get(l,r)*(day+1) + seg4.get(l,r) ans[ind] = count for i in ans: print(i)