#include<stdio.

h>
#include<stdlib.h>
int main(void)
{ int n1,n2,n,x,aux, P,i, quasiP, Q, quasiQ,max,min,d1,d2,d3,d4,d5,aux2, pd1,
pd2, pd3, pd4;
x=1;
P=0;
quasiP=0;
Q=0;
quasiQ=0;
n=0;
pd1=0;
pd2=0;
pd3=0;
pd4=0;
scanf("%d %d", &n1, &n2);
if((n1>0)&&(n2>0))
{
if(n2>n1)
{
max=n2;
min=n1;

else
{
max=n1;
min=n2;
}

for(i=min; i<=max; i++)

{
aux=i;
if(aux!=0)
{
d1=aux%10;
n=n+1;
pd1=d1;
}
if(aux/10!=0)
{
d2=(aux/10)%10;
n=n+1;
pd2=d2;
}
if(aux/100!=0)
{
d3=(aux/100)%10;
n=n+1;
pd3=d3;
}
if((aux/1000)%10>=0)
{
d4=(aux/1000)%10;
n=n;
pd4=d4;
}
 for(aux2=1; aux2<n; aux2++)
{
pd1=pd1*d1;
pd2=pd2*d2;
pd3=pd3*d3;
pd4=pd4*d4;
}

if(aux==pd1+pd2+pd3+pd4)
{printf("N= %d te la propietat P\n",
aux);
}
else if(abs(aux-(pd1+pd2+pd3+pd4))<=(n))
{printf("N= %d te la propietat quasi P\
n", aux);
}
else
{
pd1=d1;
pd2=d2;
pd3=d3;
pd4=d4;

for(aux2=1; aux2<d1; aux2++)

{
pd1=pd1*d1;}

for(aux2=1; aux2<d2; aux2++)

{
pd2=pd2*d2;}

for(aux2=1; aux2<d3; aux2++)

{
pd3=pd3*d3;}

for(aux2=1; aux2<d4; aux2++)

{
pd4=pd4*d4;}

if(abs(aux-(pd1+pd2+pd3+pd4))<=n)
{printf("N= %d te la propietat quasiQ\n",
aux);
}
pd1=d1;
pd2=d2;
pd3=d3;
pd4=d4;
}
n=0;
}
}

else
{printf("final de dades");
}
 return 0;
}