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);
		}
	}
}
import java.awt.List;
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.Collection;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;


public class ProblemC {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(new File(args[0]));
		int numberOfLines = Integer.parseInt(sc.nextLine());
		Scanner lineScan;
		int lowerBound, upperBound;
		String line;
		String number;
		String movingPart;
		String newNumber;
		int count;
		
		for (int i = 0; i< numberOfLines; i++)
		{
			line = sc.nextLine();
			lineScan = new Scanner(line);
			lowerBound = lineScan.nextInt();
			upperBound = lineScan.nextInt();
			count = 0;
			
			if (upperBound < 10)
			{
				System.out.println("Case #" + (i+1) + ": " + 0);
			}
			else
			{
				for (int j = lowerBound; j<= upperBound; j++)
				{
					number = Integer.toString(j);

					for (int k = 1; k< number.length(); k++)
					{
						if (number.charAt(k) != '0')
						{
							movingPart = number.substring(k, number.length());

							newNumber = movingPart + number.substring(0,k);

							if (Integer.parseInt(newNumber) <= upperBound && 
									Integer.parseInt(newNumber) > Integer.parseInt(number))
							{
								count ++;
								//System.out.println("Number " + number + " New number " + newNumber + "counter" + count);
							}
						}
					}


				}

				System.out.printf("Case #%d: %d\n",(i+1), count);

			}
		}
	}
}
