
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.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author UDDAMA
 */
public class recyclePair {

    private ArrayList<String> numholder = new ArrayList<String>();

    public void numrecylce(String chars) {
        for (int i = 0; i < chars.length() - 1; i++) {
            this.numholder.add(chars.substring(i + 1) + chars.substring(0, i + 1));
        }
    }

    public void cleanArray() {

        for (int i = 0; i < numholder.size(); i++) {
            String temp = numholder.get(i);
            for (int j = i + 1; j < numholder.size(); j++) {
                if (temp.equalsIgnoreCase(numholder.get(j))) {
                    numholder.remove(j);
                }
            }
        }
    }

    public int recycleCount(String A, String B) {

        int count = 0;
        for (int i = Integer.parseInt(A); i < Integer.parseInt(B); i++) {
            this.numholder.clear();
            this.numrecylce(String.valueOf(i));
            this.cleanArray();

            for (int j = 0; j < numholder.size(); j++) {

                if (Integer.parseInt(numholder.get(j)) > i && Integer.parseInt(numholder.get(j)) <= Integer.parseInt(B)) {
                    count++;
                }
            }
        }
        return count;
    }

    public static void main(String[] args) throws IOException {

        BufferedReader is = new BufferedReader(new InputStreamReader(System.in));
        String inputLine = is.readLine();
        recyclePair rp = new recyclePair();

        int cases = Integer.parseInt(inputLine);

        for (int i = 0; i < cases; i++) {

            inputLine = is.readLine();
            String[] AB = inputLine.split(" ");

            System.out.println("Case #" + (i + 1) + ": " + rp.recycleCount(AB[0], AB[1]));


        }
    }
}