
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.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author Karim
 */
public class RecycledNumbers {

    public static boolean checkNumbers(int n, int m){
        String x=""+n;
        String y=""+m;
        for (int i=0;i<x.length()-1;i++){
            String temp=""+x.charAt(x.length()-1);
            String rest=x.substring(0,x.length()-1);
            temp+=rest;
            x=""+temp;
            if (temp.equals(y)){
                return true;
            }
        }
        return false;
    }
    
    public static int range(int a, int b){
        int counter=0;
        for (int i=a;i<b;i++){
            for (int j=(i+1);j<=b;j++){
                if (checkNumbers(i, j)==true)
                    counter++;
            }
        }
        return counter;
    }
    
    public static void main(String[] args) throws FileNotFoundException {
        Scanner r=new Scanner(System.in);
        String s=r.nextLine();
        PrintWriter out=new PrintWriter("RecycledNumbers.out");
        int t=Integer.parseInt(s);
        for (int i=0;i<t;i++){
            String start=r.next();
            String end=r.next();
            int number=range(Integer.parseInt((start)), Integer.parseInt(end));
            out.write("Case #"+(i+1)+": "+number+"\n");
            out.flush();
//            System.out.println("Case #"+(i+1)+": "+number);
        }
    }
}
