AMR11E  Distinct Primes
Arithmancy is Draco Malfoy's favorite subject, but what spoils it for him is that Hermione Granger is in his class, and she is better than him at it. Prime numbers are of mystical importance in Arithmancy, and Lucky Numbers even more so. Lucky Numbers are those positive integers that have at least three distinct prime factors; 30 and 42 are the first two. Malfoy's teacher has given them a positive integer n, and has asked them to find the nth lucky number. Malfoy would like to beat Hermione at this exercise, so although he is an evil git, please help him, just this once. After all, the knowitall Hermione does need a lesson.
Input
The first line contains the number of test cases T. Each of the next T lines contains one integer n.
Output
Output T lines, containing the corresponding lucky number for that test case.
Constraints
1 <= T <= 20
1 <= n <= 1000
Example
Sample Input: 2 1 2 Sample Output: 30 42
hide comments
sanket17:
20190714 09:54:03
Brute force will work 

mr_quan1998:
20190705 19:29:12
"At leash" make me cry T_T


aj_254:
20190511 13:23:44
precompute and print. 

k_93:
20190227 05:30:17
Last edit: 20190227 05:33:15 

raghav6:
20190203 08:12:40
Hint: PreCompute only till 3000 numbers! Last edit: 20190203 08:14:21 

gokul27:
20181218 18:19:32
my 25th!! 

ashimk:
20181209 17:26:55
Simple application of Sieve.


phoemur:
20181124 17:46:09
n <= 1000 makes it too easy to golf a solution 

suyashky:
20181108 19:48:15
AC 0.00


shashankpathak:
20181001 19:08:01
Last edit: 20181001 19:55:35 
Added by:  Varun Jalan 
Date:  20111215 
Time limit:  3s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Varun Jalan  ICPC Asia regionals, Amritapuri 2011 