#include<bits/stdc++.h>
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
long long a,b,ans;
int a_[1005],b_[1005];
int main(){
	cin>>a>>b;
	for(long long i=a;i<=b;i++){
		memset(a_,0,sizeof(a_));
		memset(b_,0,sizeof(b_));
		if(i%10==0){
			continue;	
		}
		int pos;
		if(i<10){
			ans++;
			continue;
		}
		int t=i,cnt=0;
		while(t){
			a_[++cnt]=t%10;
			t/=10;	
		}
		reverse(a_+1,a_+1+cnt);
		for(int c=2;c<=cnt;c++){
			pos=c;
			for(int j=pos;j<=cnt;j++){
				b_[j-pos+1]=a_[j];
			}
			for(int j=1;j<pos;j++){
				b_[cnt+j]=a_[j];
			}
			long long sum=0,k=1;
			for(int j=cnt;j>=1;j--){
				sum+=b_[j]*k;
				k*=10;
			}
			if(sum>=a&&sum<=b){
				cout<<sum<<endl;
				ans++;
			}
		}
	}
	cout<<ans;
	return 0;
} 

求助，答案错误！！！