
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;
	}
	

}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Recycling (Numbers)
 * Jason Bradley Nel
 * 16287398
 */
import java.util.*;

public class Recycling {
    
    public static void main(String[] args) {
        
        In input = new In("input.txt");

        int T = input.readInt();

        for (int t = 0; t < T; t++){
            int min = input.readInt();
            int max = input.readInt();
            int N = max - min + 1;
            Set<String> set = new HashSet<String>();
            //if (set.isEmpty()) System.out.print("\nSET IS EMPTY");
            for (int i = min; i <= max; i++) {
                String s = "" + i;
                for (int r = 1; r < s.length(); r++) {
                    String m = returnM(s, r);
                    int num = Integer.parseInt(m);
                    String mn = s + m;
                    //System.out.printf("%d(%s)(*%d*), ", i, m, num);
                    if((num >= min) && (num <= max) && (num != i)) set.add(mn);
                }
            }
            
            //if (set.isEmpty()) System.out.print("\nSET IS EMPTY");
            int c = set.size()/2;
            System.out.printf("Case #%d: %d\n", t+1, c);
        }
    }
    
    public static String returnM(String s, int r){
        int N = s.length();
        if(r != N){
        String i = s.substring(0, N - r);
        i = s.substring(N - r, N) + i;
        return i;
        }
        else return s;
    }
}
