
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.awt.print.Printable;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class C {
    public static void main(String[] args) throws IOException {
        Scanner scanner = null;
        scanner = new Scanner(new File("C-small-attempt0.in"));
//        scanner = new Scanner(System.in);
        FileWriter writer = new FileWriter("C.out");
        int t = scanner.nextInt();
        for (int tt = 1; tt <= t ; tt ++ ) {
            int a = scanner.nextInt();
            int b = scanner.nextInt();
            
            String str;
            int k;
            int ans = 0;
            String tmp;
            for (int i = a; i <= b; i ++) {
                str = Integer.toString(i);
                if (str.length() > 1) {
                    for (int j = 1; j < str.length(); j++) {
                        tmp = str.substring(j, str.length())
                        + str.substring(0,j);
                        if (tmp.startsWith("0")) continue;
                        k = Integer.parseInt(tmp);
                        if (k >=a && k <= b && k > i) ans ++;
                    }
                }
            }
            
            writer.write(String.format("Case #%d: %d\n", tt,ans));
            System.out.println(String.format("Case #%d: %d\n", tt,ans));
        }
        writer.close();
    }

}
