Emirp numbers
##### Submissions: 365   Accuracy: 16.65%   Difficulty: Easy   Marks: 2

Emirp is the word “prime” spelled backwards, and it refers to a prime number that becomes a new prime number when you reverse its digits. Emirps do not include palindromic primes (like 151 or 787) nor 1-digit primes like 7. Given a number n, the task is to print all such prime numbers from 13 to n  whose reversed number formed is also a prime number and smaller than or equal to n.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains the integer N.

Output:
Print all Emirp numbers smaller than or equal to n in sorted order with space between two numbers. Print the answer for each test case in a new line.

Constraints:
1 <= T <= 100
13 <= N <= 105

Example:
Input:
2
40
100

Output:
13 31
13 17 31 37 71 73 79 97

#### ** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Sujnesh Mishra
Author: sujnesh

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.