Prime generator

i am getting correct ans but getting tle…please help me reduce the time…

import math
n=int(input())
a=[[]]
flag=0
for i in range(n):
    b=list(map(int,input().split()))
    if(b[1]>b[0] and b[1]<=1000000000 and b[0]<=1000000000  and b[1]-b[0]<=100000 and 1<=b[1] and 1<=b[0]):
        a.append(b)
    else:
        print("the nos entered are wrong")
        b=0
        break
print("\n")


for w in range(1,n+1,1):
    x=a[w][0]
    y=a[w][1]
    l=int(math.sqrt(y))
    prime=[]
    primes=[]
    q=0
    if(x%2==0):
        if(x==2):
            x=x+1
        if(x>2):
            x=x+1
        
    else:
        if(x==1):
            x=x+2
            
   for i in range(3,l+2,2):
        prime.append(1)
   t=x
    if(l%2==0):
        l=l-1
    t=3
    for k in range(3,l+2,2):
        if(prime[k-t]==1):
            s=k
            primes.append(k)
            if((k*k)<=l):
                for j in range(k*k,l+1,2*k):
                    d=int((j-k)/2+t)
                    prime[j-d]=0
        t=t+1
    u=len(primes)
    prime=[]
    for b in range(x,y+1,2):
        prime.append(1)
    t=x
    for g in range(x,y+1,2):
            for o in range(u):
                if((g%primes[o])==0):
                    prime[g-t]=0
                    break
             t=t+1
    t=x
    for j in range(x,y+1,2):
        if(prime[j-t]==1):
            if(j>1):
                print(j) 
        t=t+1
    w=w+1
    print("\n")

‘’’