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

}
package codejam;

import java.io.File;
import java.util.Scanner;
import java.io.FileWriter;
import java.util.Arrays;

/**
 *
 * @author Abiosoft
 */
public class Recycler {

    public static void main(String[] a) throws Exception {
        process("Recycler.in");
    }

    public static void process(String filename) throws Exception {
        File file = new File(filename);
        Scanner in = new Scanner(file);
        numberOfCase = Integer.parseInt(in.nextLine());
        String[] results = new String[numberOfCase];
        for (int i = 0; i < numberOfCase; i++) {
            String[] row = in.nextLine().split(" ");
            results[i] = "" + solve(row);
        }
        in.close();
        output(results);
    }

    public static void output(String[] results) throws Exception {
        File file = new File("Recycler.out");
        FileWriter out = new FileWriter(file);
        for (int i = 0; i < results.length; i++) {
            out.write("Case #" + (i + 1) + ": " + results[i]);
            out.write(i < results.length - 1 ? "\n" : "");
        }
        out.close();
    }

    public static int solve(String[] row) {
        int n1 = Integer.parseInt(row[0]);
        int n2 = Integer.parseInt(row[1]);
        char[] r1;
        char[] r2;
        String s1;
        String s2;
        int count = 0;
        for (int i = n1; i < n2; i++) {
            for (int j = i + 1; j <= n2; j++) {
                r1 = (i + "").toCharArray();
                r2 = (j + "").toCharArray();
                s1 = new String(r1);
                s2 = new String(r2);
                Arrays.sort(r1);
                Arrays.sort(r2);
                if (Arrays.equals(r1, r2)) {
                    count += testRecycle(s1, s2);
                }
            }
        }
        return count;
    }

    public static int testRecycle(String n, String m) {
        int count = 0;
        for (int i = 1; i < n.length(); i++) {
            String nn = n.substring(i);
            int index = m.indexOf(nn);
            if (index < 0) {
                continue;
            }
            String s = nn + n.substring(0, i);
            if (s.equals(m)) {
                return 1;
            }
        }
        return count;
    }
    public static int numberOfCase = 0;
}
