import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;


public class Main {

	private static String fileDirectory = "files/";
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Problem3(fileDirectory + "C-large.in",fileDirectory + "C-large.out");
	}
	
	public static void Problem3(String inFile, String outFile)
	{
		try {
			BufferedReader br = new BufferedReader(new FileReader(inFile));
			BufferedWriter bw = new BufferedWriter(new FileWriter(outFile));
			

			
			
			int cases = Integer.parseInt(br.readLine());
			
			for (int i = 0; i < cases; i++)
			{
				if (i > 0)
				{
					bw.newLine();
				}
				String line = br.readLine();
				String[] numbers = line.split(" ");
				int A = Integer.parseInt(numbers[0]);
				int B = Integer.parseInt(numbers[1]);
				int length = String.valueOf(A).length();
				int count = 0;
				
				
				
				for (int j = A; j <= B; j++)
				{
					String sNum = Integer.toString(j);
					HashMap<Integer, Integer> map = new HashMap<Integer,Integer>();
					//System.out.print(sNum + ": ");
					for (int k = 1; k < length; k++)
					{
						
						String newNum = sNum.substring(k, sNum.length());
						newNum += sNum.substring(0, k);
						//System.out.print(" " + newNum);
						int number = Integer.parseInt(newNum);
						if (number > j && number <= B)
						{
							if (!map.containsKey(number))
							{
								map.put(number, null);
								count++;
							}
						}
						
					}
					//System.out.println();
				}
				
				
				bw.write("Case #" + (i+1) + ": ");
				bw.write(Integer.toString(count));
			}
			
			
			bw.close();
			br.close();
		} catch (Exception e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		
	}

}
