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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.StringTokenizer;

public class recycled {
	static String next() {
		if (st == null || !st.hasMoreTokens())
			nextLine();
		return st.nextToken();
	}

	static int nextInt() {
		return Integer.parseInt(next());
	}

	static void nextLine() {
		try {
			st = new StringTokenizer(f.readLine());
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	static StringTokenizer st;
	static PrintWriter out;
	static BufferedReader f;

	public static void main(String[] args) throws IOException {
		String progName = (recycled.class.getCanonicalName()) + ".out";
		f = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
		out = new PrintWriter(new BufferedWriter(new FileWriter(progName)));
		int T = nextInt();
		for (int t = 1; t <= T; t++) {
			int count = 0;
			int A = nextInt(), B = nextInt();
			for (int x = A; x <= B; x++) {
				HashSet<Integer> hs = new HashSet<Integer>();
				String s = "" + x;
				for (int i = 1; i < s.length(); i++) {
					String ss = s.substring(i) + s.substring(0, i);
					if (ss.charAt(0) == '0')
						continue;
					int xx = Integer.parseInt(ss);
					if (xx >= A && xx <= B&&x<xx) {
						if (hs.contains(xx))
							continue;
						else
							hs.add(xx);
						count++;
					}
				}
			}
			out.printf("Case #%d: %d\n", t, count);
		}

		out.close();
		// System.exit(0);
	}

}