def rev(a):
return a[::-1]
def is_prime(a):
flag=1
for i in range(2,int(a**0.5)+1):
if a%i==0:
flag=0
break
return flag
if __name__ == '__main__':
m,n=map(int,input().split())
l=[]
flag=0
for i in range(m,n+1):
if(is_prime(i) and is_prime(int(rev(str(i))))):
l.append(i)
flag=1
print(','.join(map(str, l)))
if flag==0:
print("No")