import math

def PrimeSieve(lower, limit):
    lst = [True] * limit
    lst[0] = False
    lst[1] = False
    
    for i in range(2, int(math.sqrt(limit))):
        if not lst[i]:
            for j in range(i*2, limit, i):
                lst[j] = False
    return lst
    
print(PrimeSieve(1, 10000000))

@@ -1,8 +1,39 @@
+# Finds all primes upto limit%0A%0A
 import m
@@ -41,17 +41,17 @@
 th%0A%0Adef 
-P
+p
 rimeSiev
@@ -56,15 +56,8 @@
 eve(
-lower, 
 limi
@@ -295,35 +295,238 @@
    %0A
-print(PrimeSieve(1, 10000000)
+def booleansToNumbers(lst):%0A    numLst = %5B%5D%0A    for i, boolean in enumerate(lst):%0A        if boolean == True:%0A            numLst.append(i)%0A    return numLst%0A    %0A# Example%0AboolLst = primeSieve(100)%0AnumLst = booleansToNumbers(boolLst
 )%0A

Update Primes.py