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.util.ArrayList;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Scanner;

public class C {

	static int countBiggerRotated(int n, int B) {
		int count = 0;
		LinkedList<Integer> l = new LinkedList<Integer>();
		int t = n;
		while(t > 0) {
			l.addFirst(t%10);
			t/=10;
		}
		HashSet<Integer> hs = new HashSet<Integer>();
		for (int i = 0; i < l.size(); i++) {
			int m = 0;
			for (int j = i; j < l.size(); j++) {
				m = 10*m + l.get(j);
			}
			for (int j = 0; j < i; j++) {
				m = 10*m + l.get(j);
			}
			if(m > n && m <= B && !hs.contains(m)) {
				++count;
				hs.add(m);
//					System.out.println("(" + n + "," + m + ")");
			}
		}
		return count;
	}
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int i = 1; i <= T; i++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			
			int count = 0;
			for (int j = A; j < B; j++) {
				count += countBiggerRotated(j, B);
			}
			System.out.println("Case #" + i + ": " + count);
		}
	}

}
