Prime generator

def isprime(x):
if x==1:
return 2
i=2
while i<=x/2:
if x%i==0:
return 0
i=i+1
else:
return 1
t=int(input())
for i in range(t):
l=[int(j) for j in input().split()]
k=l[0]
while k<=l[1]:
if k%2!=0 or k==2:
if isprime(k)==1:
print(k,end=’ ')
k=k+1
print("\n")