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.Scanner;

public class prob_3 {

	public static void main(String[] args) {

		Scanner in = new Scanner(System.in);
		int cases = in.nextInt();

		for (int index = 0; index < cases; index++) {
			int A = in.nextInt();
			int B = in.nextInt();
			int possiblePermutations = (A + "").length() - 1;

			String parse;
			int count = 0;
			int m;

			int[] perms;
			for (int n = A; n < B; n++) {
				perms = new int[possiblePermutations];
				for (int i = 0; i < possiblePermutations; i++) {
					parse = n + "";
					parse = parse.substring(i + 1) + parse.substring(0, i + 1);
					m = Integer.parseInt(parse);
					perms[i] = m;
					if ((n < m) && (m <= B))
						if (counted(perms, i))
							count++;
				}
			}
			System.out.println("Case #" + (index + 1) + ": " + count);
		}
	}

	private static boolean counted(int[] perms, int i) {
		for (int j = 0; j < i; j++)
			if (perms[i] == perms[j])
				return false;

		return true;
	}
}