Strange But Easy

def prime():
size = 104900//2
sieve = [1]*size
limit = int(104900**0.5)
for i in range(1,limit):
if sieve[i]:
val = 2*i+1
tmp = ((size-1) - i)//val
sieve[i+val::val] = [0]*tmp
return list([2] + [i*2+1 for i, v in enumerate(sieve) if v and i>0])

t=int(input())
for i in range(t):
n=int(input())
for k in range(0,n*3,3):
summ=0
mul=1
mul=prime()[k]*prime()[k+1]
summ=prime()[k+2]+mul
print(summ,end=" ")
print()

I have a problem with time limit. Can you help me to improve my code, any suggestions?