#include<iostream> using namespace std; int absprime[500], aps = 0; bool isprime(int n) { if (n <= 1) return false; for (int i = 2; i <= n / i; i++) if (n % i == 0) return false; return true; } int reverse(int n) { int reversedN = 0; while (n > 0) { int digit = n % 10; reversedN = reversedN * 10 + digit; n /= 10; } return reversedN; } bool isAbsP(int n) { if (isprime(n) && isprime(reverse(n))) return true; else return false; } int main() { int m, n; bool d = false; cin >> m >> n; for (int i = m; i <= n; i++) if (isAbsP(i)) { absprime[aps++] = i; d = true; } if (d) { for (int i = 0; i < aps; i++) { cout << absprime[i]; if (i != aps - 1) cout << ","; } } else cout << "No"; return 0; }