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

public class Main {
	public static void main(String... args) throws Exception {
		int t, a, b, T;
		Scanner in = new Scanner(new File("recycled.in"));
		//PrintStream out = System.out;
		PrintStream out = new PrintStream(new File("recycled.out"));
		T = in.nextInt();
		for (t = 1; t <= T; t++) {
			a = in.nextInt();
			b = in.nextInt();
			int rez = 0;
			int i, j;
			int n = (a + "").length();
			String B = b + "";
			for (i = a; i <= b; i++) {
				String I = i + "";
				Set<String> s = new TreeSet<String>();
				s.add(I);
				for (j = 1; j < n; j++) {
					String x = I.substring(j) + I.substring(0, j);
					if (I.compareTo(x) < 0 && x.compareTo(B) <= 0 && s.add(x)) {
						rez++;
					}
				}
			}
			out.println("Case #" + t + ": " + rez);
		}
	}

}
