#include <iostream>
#include <cstring>
#include <cmath>
using namespace std;
const int m=10000000;
bool p[m+1];
void snt() {
memset(p,true,sizeof(p));
p[0]=p[1]=false;
for (int i=2;i*i<=m;++i) {
if (p[i]) {
for (int j=i*i;j<=m;j+=i) {
p[j]=false;
}
}
}
}
bool ktra(int n) {
int t=n;
while (t>0) {
if (!p[t]) {
return false;
}
t/=10;
}
return true;
}
int main() {
int a,b;
cin>>a>>b;
snt();
bool ok=false;
for (int i=a;i<=b;++i) {
if (ktra(i)) {
cout<<i<<"\n";
ok = true;
}
}
if (!ok) {
cout<<"NO";
}
return 0;
}

#include <bits/stdc++.h>
using namespace std;
#define ll long long
bool f[10000005];
void snt()
{
    memset (f, true, sizeof(f));
    f[0] = f[1] = false;
    for (ll i = 2; i <= sqrt(10000000); ++i)
    if (f[i]) for (ll j = i * i; j <= 10000000; j += i)
    f[j] = false;
}
bool check (ll n)
{
    while (n != 0)
    {
        if (!f[n]) return false;
        n /= 10;
    }
    return true;
}
ll a, b, d = 0;
int main()
{
    snt();
    cin >> a >> b;
    for (ll i = a; i <= b; ++i)
    {
        if (check(i)) 
        {
            cout << i << '\n';
            d++;
        }
    }
    if (d == 0) cout << "NO";
}