Given two positive integers L and R, return count of numbers having exactly 3 divisors from L to R inclusive.
Input:
The first line of the input contains T denoting the number of testcases. Each of the next T lines contains two space separated positive integers denoting the values of L and R respectively.
Output:
For each testcase, print the answer in a separate line.
Constraints:
1 <= T <=1000
1 <= L <= R <=109
Example:
Input:
1
1 10
Output:
2
Explanation:
In the given example, two numbers having exactly 3 divisors are 4 and 9.
blackshadows | 242 |
layman_brother | 234 |
xmyqsh | 220 |
Adarsh Trivedi | 205 |
hanuman001 | 200 |
blackshadows | 724 |
xmyqsh | 561 |
aman19 | 402 |
r0c2048 | 360 |
mb1973 | 335 |
akhayrutdinov | 5005 |
Ibrahim Nash | 4875 |
Quandray | 4338 |
sanjay05 | 3668 |
blackshadows | 3228 |