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

public class ProblemC {
	public static void main(String[] args){
		try{
			//Scanner scan = new Scanner(new File("C-small-attempt0.in"));
			Scanner scan = new Scanner(new File("C-small-attempt0.in"));
			int nLines = scan.nextInt();
			scan.nextLine();
			for(int testCase = 1; testCase <= nLines; testCase++){
				int x = scan.nextInt();
				int y = scan.nextInt();
				int recycled = 0;
				for(int a = x; a < y; a++){
					for(int b = a+1; b <= y; b++){
						if(isRecycled(a, b)){
							recycled++;
						}
					}
				}
				System.out.printf("Case #%d: %d\n", testCase, recycled);
			}
		} catch(FileNotFoundException fnfe){
			System.err.println("File Not Found");
		}
	}
	
	public static boolean isRecycled(int a, int b){
		String aStr = "" + a;
		String bStr = "" + b;
		char firstChar = aStr.charAt(0);
		int strLen = aStr.length();
		int startIndex = bStr.indexOf(firstChar);
		while(startIndex >= 0){
			if(testLocation(aStr, bStr, startIndex)){
				return true;
			}
			
			if(startIndex < (strLen-1)){
				int newIndex = bStr.substring(startIndex + 1).indexOf(firstChar);
				if(newIndex >= 0){
					startIndex += newIndex + 1;
				} else {
					break;
				}
			} else {
				startIndex = -1;
			}
		}
		return false;
	}
	
	public static boolean testLocation(String a, String b, int startPos){
		for(int i = 0; i<a.length(); i++){
			if(a.charAt(i) != b.charAt((i + startPos) %  b.length())){
				return false;
			}
		}
		return true;
	}
}