
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.ArrayList;
import java.util.List;

import Utils.FileHelper;


public class Gcj2012c {
	
	

	private static String getPairCount(String str) {
		
		int A = Integer.parseInt( str.split(" ")[0] );
		int B = Integer.parseInt( str.split(" ")[1] );
		
		boolean [] used = new boolean [ B - A + 1];
		
		int size = (A +"").length();
		int rst = 0;
		
		for( int num = A ; num <= B; ++num){
			
			int curNum = num;
			
			int cnt = 0;
			for(int i = 0; i< size; ++i){
				if(curNum > B || curNum < A || used[curNum - A]);
				else{
					used[curNum - A]  = true;
					cnt ++;
				}
				
				int lastD = curNum % 10;
				curNum /= 10;
				curNum = (int) (curNum  + Math.pow(10, size - 1) * lastD);
			}
			
			rst += cnt * (cnt-1)/2;
		}
		
		return rst +"";
	}

	
	private static void solve(String inputPath, String filepath) {
		FileHelper fHelper = new FileHelper(inputPath);
		
		String[] inputStr= new String[fHelper.getTotalSize()];
		
		List<String> rstList = new ArrayList<String>();
		
		fHelper.init(inputStr);
		
		for (String str : inputStr) {
			rstList.add(getPairCount(str));
		}
		
		rstList = format(rstList);
		
		FileHelper.writeFile(filepath, rstList);
		
	}

	



	public static void main(String[] args) {


		String inputPath = "C:\\Users\\xiaohfan\\Desktop\\C-small-attempt0.in";

		String filepath = "C:\\Users\\xiaohfan\\Desktop\\output.txt";
		
		Gcj2012c.solve(inputPath, filepath);

	}



	public static List<String> format(List<String> rstList) {
		
		List<String> outputList = new ArrayList<String>();
		
		for(int i = 0; i < rstList.size();++i	){
			outputList.add("Case #"+ (i+1) +": "+rstList.get(i));
		}
		
		return outputList;
	}
}
