
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.IOException;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

import util.MyUtil;


public class ProblemC {

	/**
	 * @param args
	 * @throws IOException 
	 * @throws NumberFormatException 
	 */
	public static void main(String[] args) throws Exception {
		String title = "C-small-attempt0.in";

		BufferedReader reader = MyUtil.getReader(title);
		int caseNumber = Integer.parseInt(reader.readLine());
		BufferedWriter writer = MyUtil.getWriter(title);
		
		for (int i = 0 ; i < caseNumber; i++){
			String line = reader.readLine();
			String result = subRoutine(line);
			
			writer.write("Case #" + (i + 1) + ": " + result + "\n");
			System.out.println("Case #" + (i + 1) + ": " + result);
		}
		
		writer.flush();

	}
	
	private static String subRoutine(String line){
		StringBuilder sb = new StringBuilder();
		String[] elements = line.split(" ");
		long A = Long.parseLong(elements[0]);
		long B = Long.parseLong(elements[1]);
		long count = 0;
		
		for (long n = A ; n < B ; n++){
			Set<Long> ms = new HashSet<Long>();
			String str = String.valueOf(Math.abs((long)n));
			String newn = Long.toString(n);
			for (int i = 1; i < str.length(); i++){
				newn = shift(newn);
				
				long m = Long.parseLong(newn);
				if (m > n && m <= B && m > A){
					ms.add(m);
					//System.out.println(n + " : " + m);
					test(n,m);
				}
			}
			count += ms.size();
			
		}
		sb.append(count);
		return sb.toString();
	}
	
	public static boolean test(long n, long m){
		String nstr = Long.toString(n);
		String mstr = Long.toString(m);
		
		for (int i = 0; i < nstr.length(); i++){
			nstr = nstr.charAt(nstr.length() - 1) + nstr;
			nstr = nstr.substring(0, mstr.length());
			
			if (nstr.equals(mstr)){
				return true;
			}
		}
		return false;
	}
	private static String shift(String nstr){
		long n =  Long.parseLong(nstr);
		StringBuilder shifted = new StringBuilder();
		long last = n % 10;
		shifted.append(last);
		for (int i = 0; i < nstr.length() - 1; i++){
			shifted.append(nstr.charAt(i));
		}
		
		return shifted.toString();
	}
}
