Sexy primes are prime numbers that differ from each other by six. For example, the numbers 5 and 11 are both sexy primes, because they differ by 6. Given a range of the form [L, R]. The task is to print all the sexy prime pairs in the range in increasing order.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case two integers L and R.
Output: For each test case, print all the sexy prime pairs in the range in increasing order in new line. If no sexy prime pair is there print "-1".