
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.
 */
package codejam;

import java.awt.List;
import java.io.*;
import java.util.ArrayList;
import java.util.Vector;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author user
 */
public class CodeJam {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        FileReader fin = null;
        FileWriter fout = null;
        ArrayList<String> ar = new ArrayList<>();
        java.util.List<String> kr;
        try {
            fin = new FileReader("input.txt");
            fout = new FileWriter("Output.txt");
            BufferedWriter out = new BufferedWriter(fout);
            BufferedReader in = new BufferedReader(fin);
            int t;
            t = Integer.parseInt(in.readLine());
            int j = 0,A,B;
            String[] k;
            while (t > j) {
                
                int count = 0;
                ar.clear();
                k = in.readLine().split(" ");
                A = Integer.parseInt(k[0]);
                B = Integer.parseInt(k[1]);
                
                for (int i = A; i <= B; i++) {
                    ar.add(Integer.toString(i));
                }
                
                StringBuilder n;
                
                for (int m = 1; m < ar.size(); m++) {
                    
                    ArrayList<String> li = new ArrayList<>();
                    n = new StringBuilder(ar.get(m));
                    char c;
                    for (int i = 0; i < n.length(); i++) {
                        li.add(n.toString());
                        c = n.charAt(0);
                        n.deleteCharAt(0);
                        n.append(c);
                    }
                    
                    kr = ar.subList(0, m-1);
                    
                    for (int i = 0; i < li.size(); i++) {
                        if (kr.contains(li.get(i))) {
                            count ++;
                        }
                    }
                }
                out.write("Case #" + (j + 1) + ": " + count + "\n");
                out.flush();
                j ++;
            }
        } catch (IOException ex) {
            Logger.getLogger(CodeJam.class.getName()).log(Level.SEVERE, null, ex);
        } finally {
            try {
                fin.close();
                fout.close();
            } catch (IOException ex) {
                Logger.getLogger(CodeJam.class.getName()).log(Level.SEVERE, null, ex);
            }
        }
            
    }
}
