2581

m = int(input())
n = int(input())
result=[]

def f(n):
found = True
if n < 2:
return -1
elif n == 2:
return n
else:
for i in range(2,int(n/2)+1):
if n%i==0:
found = False
if found:
return n
else:
return -1

for i in range(m,n+1):
if f(i)!= -1:
result.append(i)

if not result:
print(-1)
else:
print(sum(result))
print(min(result))