import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

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