import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.util.Scanner;


public class problem3 {
	public static void main(String[] args){
		try{
			  // Create file 
			  FileWriter fstream1 = new FileWriter("E:/out.txt");
			  BufferedWriter outp = new BufferedWriter(fstream1);
			  try{
				  Scanner sc = new Scanner(new File("E:/C-large.in"));
				  int cnt1=sc.nextInt();
				  cnt1=1;
				  while (sc.hasNextInt()) {
					  int low = sc.nextInt();
					  int high = sc.nextInt();
					  int cnt=0;
					  for(int i=low; i<=high;i++){
						  int y=i;
						  String str = new Integer(i).toString();
						  int[] sol = new int[str.length()];
						  int cn = 0;
						  for(int j=0;j<str.length(); j++){
							  while(y%10==0){
								  y=y/10;
								  j++;
							  }	  
							  int x=y%10;
							  y=y/10;
							  y+=x*(int)(Math.pow(10, (str.length()-1)));
							  if(y>i&&y<=high){
								  boolean rep = false;
								  for(int k=0;k<cn;k++){
									  if(y==sol[k])
										  rep = true;
								  }
								  if(rep==false){
									  cnt++;
									  sol[cn]=y;
									  cn++;
								  }
							  }
								  
						  }
						  
					  }
					  outp.write("Case #"+cnt1+": "+cnt+'\n');
					  cnt1++;
				  }
			  }catch(FileNotFoundException e){System.out.println("File not found");}
			  outp.close();
		}catch (Exception e){//Catch exception if any
		System.err.println("Error: " + e.getMessage());
		} 
	}
}
