1740 : 소수

m = int(input())
n = int(input())
sum = 0
tmin = 100000
for a in range(m, n+1):
  cnt = 0
  for i in range(1, a):
    if a%i == 0:
      cnt += 1
  if cnt == 1:
    sum += a
    if tmin >  a:
      tmin = a
print("%d\n%d" %(sum, tmin))

 

def is_prime_number(x):
  for i in range(2, x):
    if x%i == 0:
      return False
  return True

m = int(input())
n = int(input())
sum = 0
tmin = 100000
for a in range(m, n+1):
  if(is_prime_number(a)):
    sum += a
    if tmin >  a:
      tmin = a
print("%d\n%d" %(sum, tmin))

 

import math
def is_prime_number(x):
  for i in range(2, int(math.sqrt(x))+1):
    if x%i == 0:
      return False
  return True

m = int(input())
n = int(input())
sum = 0
tmin = 100000
for a in range(m, n+1):
  if(is_prime_number(a)):
    sum += a
    if tmin >  a:
      tmin = a
print("%d\n%d" %(sum, tmin))