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.util.LinkedList;
import java.util.List;
import java.util.Scanner;

public class C2 {
	
	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);
		
		int T = in.nextInt(); in.nextLine();		
		
		//for each test case
		for (int i = 1; i <= T; i++)
		{
			int A = in.nextInt();
			int B = in.nextInt();
			
			int result = 0;
			
			for (int n = A; n <= B - 1; n++)
			{
				String strN = "" + n;
				int length = strN.length();
				List<Integer> foundNewNums = new LinkedList<Integer>();
				
				for (int j = 1; j < length; j++)
				{
					String newNum = "";
							
					for (int k = 0; k < length; k++)
						newNum += strN.charAt((j + k) % length);
					
					int newNumInt = new Integer(newNum);
					
					if (newNumInt > n && newNumInt <= B && !foundNewNums.contains(newNumInt))
					{
						foundNewNums.add(newNumInt);
						result++;
					}
				}
			}
			
			System.out.format("Case #%d: %d\n", i, result);
		}
	}
}