//prime numbers (conjecture of Goldbach)
#include <stdio.h>
int simple(int);
int main(){
int a,b,i,j,j1,j2;
scanf("%d %d",&a,&b);
if(a<3)return 1;
for(i=a; i<=b; i++){
if(i%2!=0){
if(i==2147483647)break;
continue;
}
printf("%d=",i);
for(j=2; j<=i/2; j++){
j1=j; j2=i-j1;
if(simple(j1)&&simple(j2)){
printf("%d+%d\n",j1,j2);
break;
}
}
}
return 0;
}
//whether this number simple or not
int simple(int k){
int h;
for(h=2; h<k/2; h++){
if(k%h==0)break;
}
if(h==k/2)return 1; else return 0;
}