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.DataInputStream;
import java.io.EOFException;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.util.HashSet;


public class shift {

	/**
	 * @param args
	 */
	public static void main(String[] args) {

		
		try{
			FileInputStream infile = new FileInputStream("in");
			DataInputStream datain = new DataInputStream(infile);
			//Reader reader = new InputStreamReader(new FileInputStream(infile));
			FileWriter writer = new FileWriter("out", false);
			String s = datain.readLine();
			Integer k = new Integer(s);
			
			for (int i=1;i<=k;i++){
				s = datain.readLine();
				String [] ABstring = s.split(" ");
				Integer A = new Integer(ABstring[0]);
				Integer B = new Integer(ABstring[1]);				
				int numShift = ABstring[0].length()-1;
				int numRecycledNum = 0;

				for (int n=A;n<B;n++)
				{
					HashSet<String> nSet = new HashSet<String>();
					int roundShift = 1;
					String stringN = Integer.toString(n);
					stringN = stringN.substring(1) + stringN.charAt(0);
					//nSet.add(stringN);
					
					while (roundShift<=numShift){
						Integer shiftedNum = new Integer(stringN);

						if (n<shiftedNum && shiftedNum<=B && !nSet.contains(stringN)){
							nSet.add(stringN);
							numRecycledNum++;
							//System.out.println(numRecycledNum+": "+n+","+shiftedNum);
						}
						roundShift++;
						stringN = stringN.substring(1) + stringN.charAt(0);
					}
					
				}
				
				writer.append("Case #"+i+": "+numRecycledNum+"\n");
				
				
				
			}
			infile.close();
			datain.close();
			writer.close();
			
			
/*			System.out.print(i);
			writer.append("Case #1"+": ");
			int k = 2;
			while(datain.available()!=0){
				char c = (char) datain.readByte();
				if (c=='\n' && k<=i){
					writer.append('\n');
					writer.append("Case #"+k+": ");
					k++;
				}else{
					char d = mapChar(c);
					writer.append(d);
					//System.out.print(d);
				}
			}
//			writer.flush();
			infile.close();
			datain.close();
			writer.close();
*/			
			
		}catch(EOFException e){

		}catch (Exception e) {
			//infile.close();
            e.printStackTrace();
        }

	}

}
