usaco pprime

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
int prime1[110],prime2[1010],prime3[10010],p[10010],u,v,num1,num2,num3;
bool pd1(int x){
	for(u=1;u<=num1;u++)
	  if(x%prime1[u]==0) 
	    return false;
	return true;
}
bool pd2(int x){
	for(u=1;u<=num2;u++)
	  if(x%prime2[u]==0) 
	    return false;
	return true;
}
bool pd3(int x){
	for(u=1;u<=num3;u++)
	  if(x%prime3[u]==0) 
	    return false;
	return true;
}
int main(){
	int i,j,k,l,x,n,m;
	freopen("pprime.in","r",stdin);
	freopen("pprime.out","w",stdout);
	scanf("%d%d",&n,&m);
	p[1]=1;
	for(i=2;i<=10000;i++){
		j=i;
		if(p[i]) continue;
		while(j<=10000){
			j+=i;
			p[j]=1;
		}
	}
	for(i=2;i<=100;i++)
		if(!p[i]) prime1[++num1]=i;
	for(i=2;i<=1000;i++)
		if(!p[i]) prime2[++num2]=i;
	for(i=2;i<=10000;i++)
		if(!p[i]) prime3[++num3]=i;
	if(n==5) printf("5\n");
	if(n<=7) printf("7\n");
	if(n<=11) printf("11\n");
    for(i=1;i<=9;i+=2)
	  if(i!=5)
	    for(j=0;j<=9;j++){
	    	x=101*i+10*j;
	    	if(m>=x && n<=x && pd1(x)) printf("%d\n",x);
	    }  
	for(i=1;i<=9;i+=2)
	  if(i!=5)
	    for(j=0;j<=9;j++)
	      for(k=0;k<=9;k++){
	      	  x=10001*i+1010*j+100*k;
	      	  if(m>=x && n<=x && pd2(x)) printf("%d\n",x);
	      }  
	for(i=1;i<=9;i+=2)
	  if(i!=5)
	    for(j=0;j<=9;j++)
	      for(k=0;k<=9;k++)
	        for(l=0;l<=9;l++){
	        	  x=1000001*i+100010*j+10100*k+1000*l;
	        	  if(m>=x && n<=x && pd3(x)) printf("%d\n",x);
	        }
	return 0;
}