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.Scanner;

public class RecycledSmall {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int cases = scan.nextInt();
		for (int trial = 1; trial <= cases; trial++) {
			System.out.print("Case #" + trial + ": ");
			int a = scan.nextInt();
			int b = scan.nextInt();
			int rots = 0;
			for (int v = a; v < b; v++) {
				rots += countRotations(v, b);
			}
			System.out.println(rots);
		}
	}

	private static int countRotations(int v, int b) {
		String vString = Integer.toString(v);
		String nextString = vString;
		int count = 0;
		while (true) {
			nextString = rotate(nextString);
			if (nextString.equals(vString))
				break;
			int newV = Integer.parseInt(nextString);
			if (newV > v && newV <= b)
				count++;
		}
		return count;
	}

	private static String rotate(String nextString) {
		return nextString.substring(1) + nextString.charAt(0);
	}
}
