Log in
SOLVE
LATER
You need to find no. of ways of selecting a pair of prime number \((p)\) and a composite number \((q)\) in a given range \(l \leq p,q \leq r\).
Input : -
First line contains integer \(T\) ,no. of testcases.
Next \(T\) lines contains two space integers \(l\) and \(r\)
Output : -
Each test case has one output , no. of pairs of prime number and a composite number in new line.
Constraints : -
\(1 \leq T \leq 10^{5}\)
\(1 \leq l \leq r \leq 10^{5}\)
