import sys def is_prime(n): """检查一个数是否为素数。""" if n <= 1: return False if n == 2 or n == 3: return True if n % 2 == 0 or n % 3 == 0: return False i = 5 while i * i <= n: if n % i == 0 or n % (i + 2) == 0: return False i += 6 return True def find_absolute_primes(M, N): """寻找M和N之间的所有绝对素数。""" absolute_primes = [] for num in range(M, N+1): if is_prime(num): reversed_num = int(str(num)[::-1]) if num != reversed_num and is_prime(reversed_num): absolute_primes.append(num) return absolute_primes def main(): # 读取输入 M = 10 N = 35 # 寻找绝对素数 absolute_primes = find_absolute_primes(M, N) # 输出结果 if absolute_primes: sys.stdout.write(','.join(map(str, absolute_primes)) + '\n') else: sys.stdout.write('No\n') if __name__ == "__main__": main()