https://ide.codingblocks.com/s/54679
for test case3 it id TLE
Prime Visits(TLE)
your code complexity 
o(t * n * n)
required time complexity:
o(t * n * log n)
use solve to store all prime number in O(n*logn)
your code complexity
o(t * n * n)
required time complexity:
o(t * n * log n)
use solve to store all prime number in O(n*logn)