@@ -8,20 +8,8 @@ def is_prime(num):
             return False
     return True
 
-def step(g, m, n):
-    primes = []
-    
-    for i in range(m, n):
-        if is_prime(i):
-            print(i)
-            primes.append(i)
-            
-    for i in range(len(primes)):
-        num = primes[i]
-        for p in primes[i::]:
-            if p - num == g:
-                return [num, p]
-            elif p - num > g:
-                break
-                
+def step(g,m,n):
+    for i in range(m,n-g):
+        if is_prime(i) and is_prime(i+g):
+            return[i, i+g]
     return None