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

public class C {
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for(int zz = 1; zz <= T;zz++){
			int A = in.nextInt();
			int B = in.nextInt();
			int result = 0;
			for(int i=A;i<=B;i++) {
				ArrayList<Integer> pairs = new ArrayList<Integer>();
				String ns = i+"";
				for (int j=ns.length()-1;j>0;j--) {
					String k = ns.substring(j);
					String newval = k + ns.substring(0,j);
					int m = Integer.parseInt(newval);
					if (m>i && A<m && B>=m) { 
						if (pairs.indexOf(m)==-1)
							pairs.add(m);
					}
				}
				result += pairs.size();
			}
			
			System.out.format("Case #%d: %d\n", zz, result);
		}
	}
	
}
