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;
import java.util.Set;
import java.util.TreeSet;

public class C {
	public static void main(String args[]) {
		new C();
	}

	public C() {
		Scanner in = new Scanner(System.in);

		int T = in.nextInt();
		for(int x=1; x<=T; x++) {
			int a = in.nextInt();
			int b = in.nextInt();

			int y = 0;
			for(int n=a; n<=b; n++) {
				y += check(n, b);
			}

			System.out.printf("Case #%d: %d\n", x, y);
		}
	}

	public int check(int n, int b) {
		String s = Integer.toString(n);
		int nd = s.length();

		Set<Integer> set = new TreeSet<Integer>();
		int ret = 0;
		for(int d=1; d<nd; d++) {
			String ms = s.substring(nd-d) + s.substring(0, nd-d);
			int m = Integer.parseInt(ms);
			if(n < m && m <= b) {
				if(set.contains(m)) continue;

				ret++;
				set.add(m);
			}
		}

		return ret;
	}
}