Practice on Toph

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

Largest Prime

Limits 1s, 512 MB

A positive integer number n is called a prime number, if it is only divisible by 1 and n itself, where 1 != n. There exists an infinitely many prime numbers! But as the number gets larger, the distribution of primes among them gets less frequent.

You want to investigate the distribution of prime numbers. As a part of this investigation, you want to find out the largest prime number in a given range.

Input

The first line contains an integer Q (1 ≤ Q ≤ 105), the number of queries that will be given. The next Q lines will contain two integers li (1 ≤ li) and ri (ri ≤ 10000).

Output

For each line of query, print a single line, containing the largest prime in the range li and ri inclusive. If there is no prime numbers in a given range, print -1 instead. Please see the samples for the exact formatting.

Sample

InputOutput
5
25 28
1 1
2 3
8 12
14 20
-1
-1
3
11
19


Discussion
Statistics

84% Solution Ratio

fsshakkhorEarliest, Dec '16

NJRafiFastest, 0.0s

RedwanuzzamanLightest, 3.8 MB

mrbayatiShortest, 328B

Submit

Login to submit