
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.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;


public class RecycledNumbers {
	String filename;
	BufferedReader br;
	PrintWriter pw;
	
	public RecycledNumbers(String filename) throws FileNotFoundException {
		this.filename = filename;
		br = new BufferedReader(new FileReader(filename));
		pw = new PrintWriter("output-3.txt");
	}
	
	public void processInput() throws NumberFormatException, IOException {
		StringBuffer sb = new StringBuffer();
		int numCases = Integer.parseInt(br.readLine());
		for(int i=0; i<numCases; i++) {
			sb.append("Case #" + (i+1) + ": " + processCase(br.readLine()));
			if(i!=numCases-1) sb.append("\n");
		}
		pw.print(sb.toString());
		
		br.close();
		pw.close();
	}
	
	Set<Integer> visitedSet;
	
	private int processCase(String inputCase) {
		String[] s = inputCase.split(" ");
		int A = Integer.parseInt(s[0]);
		int B = Integer.parseInt(s[1]);
		visitedSet = new HashSet<Integer>();
		int res = 0;
		
		for(int i=A; i<=B; i++) {
			if(!visitedSet.contains(i))
				res+= process(i, A, B);
		}
		return res;
	}
	
	private int process(final int n, final int A, final int B) {
		String s = Integer.toString(n);
		int count=0;
		
		for(int i=s.length()-1; i>0; i--) {
			String s1 = s.substring(i) + s.substring(0, i);
			int num = Integer.parseInt(s1);
			visitedSet.add(num);
			if(num!=n && num>=A && num<=B) { if(num<n) System.out.println(num + ", " + n); else System.out.println(n + ", " + num); count++; }
		}
		visitedSet.add(n);
		return (count==0) ? 0 : (count+1)*(count)/2;
	}
}

class Main3 {
	public static void main(String args[]) throws NumberFormatException, IOException {
		RecycledNumbers r = new RecycledNumbers("C-small-attempt0.in.txt");
		r.processInput();
	}
}