#include 
#include
#include
using namespace std;

int main()
{
int s,e;
cin>>s>>e;
int razlika=e-s;
int palindromi[e-s+1];
int brojac=0;
for(int i=1;i<=(e-s);i++)
{
int e_palindrom = 1;
vector v;
int tmp = i;
while(tmp > 0) {
v.push_back(tmp % 10);
tmp /= 10;
}
int a = 0, b = v.size() - 1;
while(a < b) {
if(v[a] != v[b]) {
e_palindrom = 0;
break;
}
a += 1;
b -= 1;
}
if(e_palindrom==1)
{
palindromi[brojac]=i;
brojac++;
}
}
queueq;
q.push(s);
q.push(0);
int visited[e+1];
for(int i=0;i