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

import java.io.*;
import java.util.ArrayList;

/**
 *
 * @author Nimos
 */
public class QuestionC {

    public static void main(String args[]) {
        try {
            File input = new File("C:\\Users\\Nimos\\Desktop\\INPUTS\\2012\\C-small-attempt0(1).in");
            FileReader fr = new FileReader(input);
            BufferedReader br = new BufferedReader(fr);
            PrintWriter out = new PrintWriter(new File("C:\\Users\\Nimos\\Desktop\\INPUTS\\2012\\C-small-ans.in"));
            String no = br.readLine();
            int number = Integer.parseInt(no);
            for (int h = 0; h <= number - 1; h++) {
                int done =0;
                String nos = br.readLine();
                String[] n = nos.split(" ");
                int s = Integer.parseInt(n[0]);
                int e = Integer.parseInt(n[1]);
                int size = n[0].length();
               // ArrayList al = new ArrayList();
                
                for (int i=s;i<=e;i++){
                    String t = Integer.toString(i);
                    for (int j = 1;j<size;j++){
                        t= t.substring(1,size)+t.substring(0,1);
                        //System.out.print(j+" ");
                        int k = Integer.parseInt(t);
                        if (k>i && k<=e && k>=s){
                            done++;
                            //System.out.println(done + " " + i);
                            //al.add(t); 
                        }
                                                
                    }
                }

                int m = 1 + h;
                String ans = "Case #" + m + ": " + done;
                out.println(ans);
                out.flush();

            }


            br.close();
            out.close();

        } catch (IOException e) {
            e.printStackTrace();

        }
    }

}
