def f(x,l,r)
	if l==r
		$hs[[l,r]]+=1
	elsif (l<=x&&x<=r)
		$hs[[l,r]]+=1
		m=(l+r)/2
		f(x,l,m)
		f(x,m+1,r)
	end
end
def sum(l,r,l2,r2)
	if $hs.key?([l,r])==false
		return 0
	else
		if r<l2
			return 0
		end
		if r2<l 
			return 0
		end
		if(l2<=l&&r<=r2)
			return $hs[[l,r]]
		end
		m=(l+r)/2
		res=sum(l,m,l2,r2)
		res+=sum(m+1,r,l2,r2)
		return res
	end
end

n=gets.to_i
ab=[]
n.times{
	a,b=gets.split.map{|e| e.to_i}
	ab<<[a,-b]
}
m=gets.to_i
xy=[]
no=1
m.times{
	x,y=gets.split.map{|e| e.to_i}
	xy<<[x,-y,no]
	no+=1
}
ab=ab.sort.reverse
xy=xy.sort.reverse
$hs=Hash.new(0)
rmax=134217727
$hs[[0,rmax]]=0

ans=[]

while ab.empty? == false && xy.empty? == false
	while ab.empty? ==false && (xy.empty? ==true || ab[0][0]>=xy[0][0])
		f(-ab.shift[1],0,rmax)
	end
	
	while xy.empty? ==false && (ab.empty? ==true || xy[0][0]>ab[0][0])
		e1=xy.shift
		ans<<[sum(0,rmax,0,-e1[1]),e1[2]]
	end
end
ans=ans.sort.reverse
ans2=[]
if ans.empty? == true || ans[0][0]==0
	puts 0
else
	e=ans[0][0]
	while ans.empty? == false && ans[0][0]==e
		ans2<<ans.shift[1]
	end
	puts ans2.sort
end