def find_absolute_primes(M,N): def is_prime(num): if num==1: return False if num==2: return True for i in range(2,int(num**0.5)+1): if num%i==0: return False return True def reverse_num(num): return int(str(num)[::-1]) absolute_primes=[] for num in range(M,N+1): if is_prime(num) and is_prime(reverse_num(num)): absolute_primes.append(num) if absolute_primes: return ",".join(map(str,absolute_primes)) else: return"No" M,N=map(int,input().split()) print(find_absolute_primes(M,N))