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

public class Tres {
    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new FileReader("tres.txt"));
        int T = Integer.parseInt(in.readLine());
        for(int t = 0; t < T; t++) {
            String[] temp = in.readLine().split(" ");
            int A = Integer.parseInt(temp[0]);
            int B = Integer.parseInt(temp[1]);
            HashMap<String, Integer> matches = new HashMap<String, Integer>();
            for(int i = A; i <= B; i++) {
                String s = new Integer(i).toString();
                int j;
                for(j = 0; j < s.length(); j++) {
                    String stemp = s.substring(j) + s.substring(0,j);
                    if(matches.containsKey(stemp)) {
                        matches.put(stemp, matches.get(stemp)+1);
                        //System.out.println(s + " matched with " + stemp);
                        break;
                    }
                }
                if(j == s.length()) matches.put(s, 1);
            }
            int answer = 0;
            for(String s : matches.keySet()) {
                int itemp = matches.get(s);
                answer += itemp*(itemp-1)/2;
            }
            System.out.println("Case #" + (t+1) + ": " + answer);
        }
        in.close();
    }
}