import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Recycled {
	public static void main(String[] args) throws Exception{
		String inputFile = "C-small-attempt0.in";
		
		BufferedReader input = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
		BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output")));
		long num_cases = Long.parseLong(input.readLine());
		int current_case = 0;
		
		while (current_case < num_cases){
			current_case++;
			
			String[] fields = input.readLine().split(" ");
			int A = Integer.parseInt(fields[0]);
			int B = Integer.parseInt(fields[1]);
			int total = 0;
			
			for (int n = A; n < B; n++){
				for (int m = n+1; m <= B; m++){
					if (isRecycled(n,m)) total++;
				}
			}
			
			System.out.println("Case #" + current_case + ": " + total);
			output.write("Case #" + current_case + ": " + total + "\n");
		}
		output.close();
	}

	private static boolean isRecycled(int n, int m) {
		String sn = ""+n;
		String sm = ""+m;
		if (sn.length() != sm.length()) return false;
		int totaln = 0, totalm = 0;
		for (int i = 0; i < sn.length(); i++){
			totaln += sn.charAt(i);
			totalm += sm.charAt(i);
		}
		if (totaln != totalm) return false;
		for (int i = 0; i < sn.length()-1; i++){
			sm = sm.charAt(sm.length() - 1) + sm.substring(0, sm.length() - 1);
			if (sm.equals(sn)) return true;
		}
		return false;
	}
}

import java.util.Scanner;
import java.io.File;
import java.io.FileOutputStream;
import java.io.PrintStream;

public class Recycled {
  public static void main(String[] args) {
	try {
	  Scanner sc = new Scanner(new File("input.in"));
	  FileOutputStream output = new FileOutputStream("output.txt");
	  PrintStream p = new PrintStream(output);
	  int cases = Integer.parseInt(sc.nextLine());
	  for ( int i = 0; i < cases; i++ ) {
	    String aCase = sc.nextLine();
		int res = -1;
		int A = 0, B = 0;
		Scanner tmp = new Scanner(aCase);
		if(tmp.hasNextInt())
		  A = tmp.nextInt();
        if(tmp.hasNextInt())
		  B = tmp.nextInt();
		
        if(A >= B)
		  res = 0;		
		else
	      res = findRecycle(A,B);
		  
		int x = i+1;
        p.println("Case #" + x + ": " + res);		
	  }
	}
	catch(Exception e) {
	  e.printStackTrace();
	}
  }
  
   public static int findRecycle(int A, int B) {
     System.out.println("Find recycle " + A +", " + B);
     int count = 0;
	 for (int n = A; n < B; n++) {
	   for (int m = n + 1; m <= B; m++) {
	     if(isRecycled(Integer.toString(n), Integer.toString(m)))
		   count++;
		   //System.out.println(count);
	   }
	 }
	 return count;
   }
   
   public static boolean isRecycled(String n, String m) {
     int suffixes = n.length();
	 for (int i = 1; i < suffixes; i++) {
	   String tmp = n.substring(i);
       String toComp = tmp;
       for (int x = 0; x < i; x++) {
	     toComp += n.charAt(x);
       }	   
	   if(toComp.equals(m))
	     return true;	
	 }
     return false;
   }
  }