package it.simone.google.code.jam2012;

import java.util.HashSet;
import java.util.Set;

public class RecycledNumber implements GoogleCodeExercise {

	int a = 0;
	int b = 0;
	Set<Couple> distinctCouple = null;
	long maxTime = 0;

	private class Couple {
		int x = 0;
		int y = 0;

		public Couple(int x, int y) {
			this.x = x;
			this.y = y;
		}

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + getOuterType().hashCode();
			result = prime * result + x;
			result = prime * result + y;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Couple other = (Couple) obj;
			if (!getOuterType().equals(other.getOuterType()))
				return false;
			if (x == other.x && y == other.y)
				return true;
			if (x == other.y && y == other.x)
				return true;
			return false;
		}

		private RecycledNumber getOuterType() {
			return RecycledNumber.this;
		}

	}

	@Override
	public String execute(String line) {
		int result = 0;

		String[] data = line.split(" ");
		a = Integer.parseInt(data[0]);
		b = Integer.parseInt(data[1]);
		initialize();

		int n = a;
		//
		while (n <= b) {
			result += analize(n);
			n++;
//			if (n % 1000 == 0)
//				System.out.println(n);
		}

		System.out.println(result);
		return "" + result;
	}

	@Override
	public void initialize() {
		distinctCouple = new HashSet<Couple>();
	}

	private int analize(int number) {
		String numString = "" + number;
		initialize();
		for (int i = 1; i < numString.length(); i++) {
			int m = shift(numString, i);
			if (a <= number && number < m && m <= b) {
				Couple couple=new Couple(number,m);
				if (!distinctCouple.contains(couple))
					distinctCouple.add(couple);
			}
		}
		return distinctCouple.size();
	}

	private int shift(String numString, int posx) {

		String result = null;
		result = "" + numString.substring(posx) + numString.substring(0, posx);

		return Integer.parseInt(result.toString());
	}

}

import java.io.*;

class Recycle{
public static void main(String arg[])throws Exception
{
File f=new File("C-large.in");
FileInputStream fin=new FileInputStream(f);
File f2=new File("bo.txt");
FileOutputStream fout=new FileOutputStream(f2);
BufferedWriter bwr=new BufferedWriter(new OutputStreamWriter(fout));
BufferedReader br=new BufferedReader(new InputStreamReader(fin));
String g="";

long ipn=Long.parseLong(br.readLine());
long ipni=1;
long a,b;
String e="";
long n,m;
while(--ipn >=0)
{
long count=0;
g=br.readLine();
a=Long.parseLong(g.substring(0,g.indexOf(" ")) );
b=Long.parseLong( g.substring(g.indexOf(" ")+1,g.length())) ;

for(long i=a;i<=b;i++)
{
n=i;
	for(long j=0 ; j<(i+"").length()-1; j++)
	{ 
		
		 m=shift(n);
		 if(m>-1)
		if(i<m && m <=b)
		{count++;
		}
		n=m;
		
	}
}


bwr.write("Case #"+(ipni++)+": "+count);
bwr.newLine();
bwr.flush();
}//while

}

public static long shift(long num)
{

	String s;
	if(num<0)
	s="0"+(-num)+"";
	else
	s=num+"";
	String ss=s.charAt(s.length()-1)+s.substring(0,s.length()-1);
	if(s.charAt(s.length()-1)=='0')
	return(-Long.parseLong(ss));
	return (Long.parseLong(ss));
}
}