"""
ровно 3 четных делителя
2, 2*p, 2*p**2
где p - простые числа
"""
def isPrime(n):
if n<2: return False
elif n==2: return True
if n % 2 == 0: return False
i = 3
while i * i <= n:
if n % i == 0:
return False
i += 2
return True
N,M = 101_000_000, 102_000_000
p = int((N/2)**0.5)//2*2+1
while 1:
if isPrime(p):
break
p += 2
pp = []
while 1:
if isPrime(p):
pp.append(2*p**2)
p += 2
if 2*p**2 > M:
break
print(*pp, sep='\n')#или print(*pp) если в одну строку
IiIiCtGA0L7QstC90L4gMyDRh9C10YLQvdGL0YUg0LTQtdC70LjRgtC10LvRjwoyLCAyKnAsIDIqcCoqMgrQs9C00LUgcCAtINC/0YDQvtGB0YLRi9C1INGH0LjRgdC70LAKIiIiCmRlZiBpc1ByaW1lKG4pOgogICAgaWYgbjwyOiByZXR1cm4gRmFsc2UKICAgIGVsaWYgbj09MjogcmV0dXJuIFRydWUKICAgIGlmIG4gJSAyID09IDA6IHJldHVybiBGYWxzZQogICAgaSA9IDMKICAgIHdoaWxlIGkgKiBpIDw9IG46CiAgICAgICAgaWYgbiAlIGkgPT0gMDoKICAgICAgICAgICAgcmV0dXJuIEZhbHNlCiAgICAgICAgaSArPSAyCiAgICByZXR1cm4gVHJ1ZQoKCk4sTSA9IDEwMV8wMDBfMDAwLCAxMDJfMDAwXzAwMAoKcCA9IGludCgoTi8yKSoqMC41KS8vMioyKzEKd2hpbGUgMToKICAgIGlmIGlzUHJpbWUocCk6CiAgICAgICAgYnJlYWsKICAgIHAgKz0gMgoKcHAgPSBbXQp3aGlsZSAxOgogICAgaWYgaXNQcmltZShwKToKICAgICAgICBwcC5hcHBlbmQoMipwKioyKQogICAgcCArPSAyCiAgICBpZiAyKnAqKjIgPiBNOgogICAgICAgIGJyZWFrCnByaW50KCpwcCwgc2VwPSdcbicpI9C40LvQuCBwcmludCgqcHApINC10YHQu9C4INCyINC+0LTQvdGDINGB0YLRgNC+0LrRgwo=