import java.util.*;
import java.io.*;

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
package Round1;

/*
 ID: kevinle7
 LANG: JAVA
 TASK: recycled
 */
import java.io.*;
import java.util.*;

class recycled
{	
	public static int[] pow = {1,10,100,1000,10000,100000,1000000,10000000,100000000};
	public static void main(String[] args) throws IOException
	{
		BufferedReader f = new BufferedReader(new FileReader("recycled.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("recycled.out")));
		int t = Integer.parseInt(f.readLine());
		for (int i = 0 ; i < t; i++)
		{
			StringTokenizer st = new StringTokenizer(f.readLine());
			int a = Integer.parseInt(st.nextToken());
			int b = Integer.parseInt(st.nextToken());
			int d = (int) Math.log10(a);
			int count = 0;
			for (int n = a; n < b; n++)
			{
				HashSet<Integer> set = new HashSet<Integer>();
				set.add(n);
				int temp = n;
				temp = temp/10 + (temp%10)*pow[d];
				while (!set.contains(temp))
				{
					set.add(temp);
					if (temp > n && temp <= b)
						count++;
					temp = temp/10 + (temp%10)*pow[d];
				}
			}
			out.println("Case #" + (i+1) + ": "  + count);
		}
		out.close();
		System.exit(0);
	}
	
}