
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}
import java.io.*;

public class RecycledNumbers {


	public static void main(String[] args) {

		BufferedReader in;
		BufferedWriter out;
		int T, i;
		String line;
		

		try {
			in = new BufferedReader(new FileReader("input.txt"));
			out = new BufferedWriter(new FileWriter("output.txt"));
		} catch (FileNotFoundException e) {
			System.out.println(e.getMessage());
			return;
		} catch (IOException e) {
			System.out.println(e.getMessage());
			return;
		}

		try {
			T = Integer.parseInt(in.readLine());

			for (i = 0; i < T; i++) {
				line = in.readLine();

				String lineToWrite = "Case #" + (i+1) + ": ";

				lineToWrite += String.valueOf(solve(line));

				out.write(lineToWrite + "\n");

			}
			in.close();
			out.close();
		} catch (IOException e) {
			System.out.println(e.getMessage());
			return;
		}
	}

	public static int solve(String input) {
		int a, b, counter;
		String[] inputs = input.split(" ");
		a = Integer.parseInt(inputs[0]);
		b = Integer.parseInt(inputs[1]);
		counter = 0;

		for (int n = a; n < b; n++) {

			int i;
			for (i = 10; i < b; i *= 10) {
				int m = split(n, i);

				if (m > n && m <= b) counter++;

			}


		}
		return counter;

	}
	
	public static int split(int num, int pow) {
		int half1, half2;
		half1 = num/pow;
		half2 = (num%pow) * (orderOf(num) / pow);
		return half1 + half2;
	}
	
	public static int orderOf(int num) {
		int i = 1;
		while (i < num) {
			i*=10;
		}
		return i;
	}
}
