
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.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map;


public class Recycling {
	Map<String, Boolean> map = null;
	
	public static void main(String[] args) {
		String inFile = args[0];
		//String inFile = "resources/C-small-attempt1.in";
		
		try {
			new Recycling().whatever(inFile, inFile+".out");
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	private void whatever(String inFile, String outFile) throws NumberFormatException, IOException {
		StringBuffer out = new StringBuffer();
		BufferedReader br = new BufferedReader(new FileReader(new File(inFile)));
	    String line;
	    int currentLineNumber = 0;
	    int totalTestCases = 0;
	    
	    while((line = br.readLine()) != null) {
	    	if(currentLineNumber == 0){
	    		totalTestCases = Integer.valueOf(line);
	    		currentLineNumber++;
	    		continue;
	    	}
	    	
	    	String[] tokenizedLine = line.split(" ");
	    	int a = Integer.valueOf(tokenizedLine[0]);
	    	int b = Integer.valueOf(tokenizedLine[1]);
		
	    	int count = countRecyclings(a, b);
	    	out.append("Case #"+currentLineNumber+": "+count+System.getProperty("line.separator"));
	    	currentLineNumber++;
	    }
	    
	    writeTextToFile(out.toString(), outFile);
	}
	
	
	private int countRecyclings(int a, int b){
		map = new HashMap<String, Boolean>();
		int recyclingCount = 0;
		for(int n = a; n<= b; n++){
			for(int j = 1; j<(""+n).length(); j++){
				String r = (""+n).substring((""+n).length()-j);
				if(!r.startsWith("0")){
					String m = r+(""+n).substring(0, (""+n).length()-j);
					if(a <= n && n < Integer.valueOf(m) && Integer.valueOf(m) <= b){
						if(!map.containsKey(n+m)){
							map.put(n+m, true);
							recyclingCount++;
						}
					}
				}
			}
		}
		return recyclingCount;
	}
	
	private void writeTextToFile(String text, String outputFileName) throws IOException{
		 BufferedWriter out = new BufferedWriter(new FileWriter(outputFileName));
		 out.write(text);
		 out.close();
	}
}
