#include<iostream>#include<string>#include<cstring>#include<set>#include<algorithm>#include<cmath>using namespace std;const int N = 9999;bool PRime[N];void init(){	fill(prime+2, prime+N, true);	for(int i = 2; i<=sqrt(N); ++i)	{		if(prime[i])		{			for(int j = i+i; j<N; j+=i)			{				prime[j] = false;			}		}	}}int main(){	init();	int p[N],i,j,k,index=0;	for(i=0;i<N;i++)	{		if(prime[i]==true)			p[index++]=i;	}	int n,m;	cin>>n>>m;	for(i=n;i<=m;i++)	{		cout<<i<<"=";		if(prime[i])			cout<<i<<endl;		else		{			index=0;			k=i;			int flag=1;			while(true)			{				if(k%p[index]==0)				{					if(flag)					{						cout<<p[index];						flag=0;					}					else						cout<<"*"<<p[index];					k/=p[index];				}				else				{					index++;				}				if(k==1)					break;			}			cout<<endl;		}	}}