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

import java.io.*;
import java.util.Scanner;

/**
 *
 * @author Novin Pendar
 */
public class C {
    public static void main(String[] args) throws FileNotFoundException, IOException{
        File fi=new File("C-small-attempt0.in");
        FileReader fr=new FileReader(fi);
        Scanner con=new Scanner(fr);
        int n=Integer.valueOf(con.nextLine()).intValue();
        int a,b;
        File fo=new File("C-small-attempt0.out");
        PrintWriter pr=new PrintWriter(fo);
        for(int i=0;i<n;i++){
            String st=con.nextLine();
            String[] starr=st.split(" ");
            a=Integer.valueOf(starr[0]).intValue();
            b=Integer.valueOf(starr[1]).intValue();
            pr.println("Case #"+(i+1)+": "+g(a,b));
            System.out.println("Case #"+(i+1)+": "+g(a,b));
        }
        fr.close();
        pr.close();
        
    }
    public static boolean f(String s1,String s2){
        int n=s1.length();
        String t,t1,t2;
//        n--;
        for(int i=1;i<n;i++){
            t1=s1.substring(0, i);
            t2=s1.substring(i);
            t=t2+t1;
            if(t.equals(s2)){
                return true;
            }
        }
        return false;
    }
    public static int g(int a,int b){
        int count=0;
        for(int i=a;i<=b;i++){
            for(int j=i+1;j<=b;j++){
                if(f(String.valueOf(i),String.valueOf(j))==true){
                    count++;
                }
            }
        }
        return count;
    }
}
