The following algorithm seems to be working fine, but when i submit it, its giving NZEC time error.
def primes(a,n):
if n<2:
return []
sieve=[True]*(n+1)
sieve[0]=False
sieve[1]=False
for i in range(2,int(n**0.5)+1):
if sieve[i]:
for j in range(i**2,n+1,i):
sieve[j]=False
for i in range(a,n+1):
if sieve[i]:
print i
n=int(raw_input())
a=list()
for i in range(n):
a.append(raw_input().split())
for i in range(n):
primes(int(a[i][0]),int(a[i][1]))
if i!=n-1:
print ""
thanks in advance