#include <bits/stdc++.h>
#define ll long long
#define endl '\n'
//#pragma GCC optimize(2)
using namespace std;
const int E=1e8+114514;
bool cmp[E]={};
ll n=0,m=0;
ll temp1=0;
int main(){
	scanf("%lld%lld",&n,&m);
	for(int i=2;i*i<=m;i++){
		if(cmp[i]==0){
			for(int j=2*i;j<=m;j+=i){
				cmp[j]=1;
		//		cout <<j<<endl;
			}
		}
	}
	for(int i=n;i<=m;i++){
		if(i==9989900){
		    break;
		}
		if(i%2==0 && i!=2){
			continue;
		}
		if(i%3==0 && i!=3){
			continue;
		}
		if(i%5==0 && i!=5){
		    continue;
		}
		ll temp=i,sum=0;
		while(temp){
			sum=sum*10+temp%10;
			temp/=10;
		}
		if(sum==i){
			if(cmp[i]==0){
				printf("%d\n",i);
			}
		}
	}
	return 0;
}

能用的优化都用了，还是TLE0.03秒，求大神帮助