Given two positive integers L and R, return count of numbers having exactly 3 divisors from L to R inclusive.
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.
For each testcase, print the answer in a separate line.
1 <= T <=1000
1 <= L <= R <=109
In the given example, two numbers having exactly 3 divisors are 4 and 9.