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();
		}
	}
}

package recycled;

import java.util.Scanner;

public class Recycled {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int t = scanner.nextInt();
        int[] count = new int[t];
        for (int i = 0; i < t; i++) {
            int a = scanner.nextInt();
            int b = scanner.nextInt();
            for (int j = a; j <= b; j++) {
                String temp = Integer.toString(j);
                int index=0;
                 int[] num=new int[(int) Math.log10(j)];
                for (int k = 0; k < Math.log10(j); k++) {
                    if (Math.log10(j) >= 1) {
                       
                        
                        String temp2 = temp.substring(k + 1, temp.length()) + temp.substring(0, k + 1);
                        int temp3 = Integer.parseInt(temp2);
                        if (temp3 <= b & temp3>j) {
                            count[i]++;
                            num[index]=temp3;
                            index++;
                        }
                    }
                }
                if (index>1){
                for(int k=0;k<index;k++){
                    for(int l=k+1;l<index;l++ ){
                        if (num[k]==num[l]){
                            count[i]--;
                        }
                    }
                    }
                }
            }
        }
        for (int i = 0; i < t; i++) {
            System.out.println("Case #" + (i + 1) + ": " + count[i]);
        }
    }
}
