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

class B
{
	public static void main(String[] args) 
	{
		try
		{
			BufferedReader br = new BufferedReader(new FileReader("B.in"));
			PrintWriter pw = new PrintWriter(new FileWriter("B.out"));
			int X = Integer.parseInt(br.readLine());

			for(int i=0; i<X; i++)
			{
				String[] S = br.readLine().split(" ");
				int A = Integer.parseInt(S[0]);
				int B = Integer.parseInt(S[1]);
				int R = 0;

				int x = 1;
				int n = 0;
				while(A/x > 0) {
					n++;
					x *= 10;
				}

				for(int j=A; j<B; j++) {
					Set<Integer> seen = new HashSet<Integer>();
					for(int k=1; k<n; k++) {
						int p1 = j % (int)Math.pow(10, k);
						int p2 = (int) Math.pow(10, n-k);
						int p3 = j / (int)Math.pow(10, k);
						int y = p1*p2 + p3;
						
						if(j < y && !seen.contains(y) && y <= B) {
							seen.add(y);
							R++;
						}
					}
				}

				pw.printf("Case #%d: %d\n", i+1, R);
				pw.flush();
			}
		}
		catch(Exception e)
		{ 
			e.printStackTrace();
		}
	}
}

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

public class Problem_C {
    public static void main(String[] args) throws IOException
            {

                String fileName = "C-large.in";
                FileReader reader = new FileReader(fileName);
                LineNumberReader lnreader = new LineNumberReader(reader);
                FileWriter writer = new FileWriter("output-C-large.txt");
                PrintWriter out = new PrintWriter(writer);
                
                String line = ""; 
                line = lnreader.readLine();
                String line_array[];
                int A;
                int B;
                int length;
                int recycled;
                int count = 0;
				List<Integer> rec_list = new ArrayList<Integer>();
                int index = 0;

                while ((line = lnreader.readLine()) != null){
                    count = 0;
                    line_array = line.split(" ");
                    length = line_array[0].length();
					rec_list.clear();
                    A = Integer.parseInt(line_array[0]);
                    B = Integer.parseInt(line_array[1]);
                    for (int k=A;k<B;k++){
                        recycled = k;
						rec_list.clear();
                        for (int j=1;j<length;j++){
                            recycled = recycle(recycled,length);
                            if ((recycled > k) && (recycled <= B)){
                                if (!rec_list.contains(recycled)){
                                    count++;
                                    rec_list.add(recycled);
                                }
                            }
                        }
                    }

                    out.println("Case #" + (lnreader.
                    getLineNumber()-1) + ": " + count);
                }
                out.close();

            }

            private static  int recycle(int a,int length){
                int r = a%10;
                int q = a/10;
                r = r * (int)java.lang.Math.pow(10,length-1);
                return (r+q);
            }
}

