import java.io.*;
import java.util.*;

class B
{
	public static void main(String[] args) 
	{
		try
		{
			BufferedReader br = new BufferedReader(new FileReader("B.in"));
			PrintWriter pw = new PrintWriter(new FileWriter("B.out"));
			int X = Integer.parseInt(br.readLine());

			for(int i=0; i<X; i++)
			{
				String[] S = br.readLine().split(" ");
				int A = Integer.parseInt(S[0]);
				int B = Integer.parseInt(S[1]);
				int R = 0;

				int x = 1;
				int n = 0;
				while(A/x > 0) {
					n++;
					x *= 10;
				}

				for(int j=A; j<B; j++) {
					Set<Integer> seen = new HashSet<Integer>();
					for(int k=1; k<n; k++) {
						int p1 = j % (int)Math.pow(10, k);
						int p2 = (int) Math.pow(10, n-k);
						int p3 = j / (int)Math.pow(10, k);
						int y = p1*p2 + p3;
						
						if(j < y && !seen.contains(y) && y <= B) {
							seen.add(y);
							R++;
						}
					}
				}

				pw.printf("Case #%d: %d\n", i+1, R);
				pw.flush();
			}
		}
		catch(Exception e)
		{ 
			e.printStackTrace();
		}
	}
}

import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Scanner;

public class ProblemC {
	public static void main(String[] args) throws Exception {

		Scanner in = new Scanner(//
				// System.in
//				new FileInputStream("c-small.in")
		 new FileInputStream("c-large.in")
		);
		PrintStream out = new PrintStream( //
				// System.out
//				new FileOutputStream("c-small.out")
		 new FileOutputStream("c-large.out")
		);

		int T = in.nextInt();
		for (int i = 1; i <= T; i++) {
			int A = in.nextInt();
			int B = in.nextInt();
			int res = 0;
			for (int x = A; x < B; x++) {
				res += cycle(x, A, B);
			}
			out.println("Case #" + i + ": " + res);
		}
	}

	private static int cycle(int n, int A, int B) {
		int m = n;
		int digits = (int) Math.log10(n) + 1;
		if (digits == 1)
			return 0;
		int mul = 1;
		for (int i = 1; i < digits; i++)
			mul *= 10;
		int ret = 0;
		HashSet<Integer> used = new HashSet<Integer>();
		for (int i = 0; i < digits; i++) {
			m = (m / 10) + (m % 10) * mul;
			if (m > n && m != n && m <= B && !used.contains(m)) {
				ret++;
				used.add(m);
			}
		}
		return ret;
	}

}
