/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.File;
import java.io.FileInputStream;
import java.util.Scanner;

/**
 *
 * @author imgps
 */
public class C {
    public static void main(String args[]) throws Exception{
        int A,B;
        int ctr = 0;
        int testCases;
        
        Scanner sc = new Scanner(new FileInputStream("C-small-attempt0.in "));
        testCases = sc.nextInt();
        int input[][] = new int[testCases][2];
        for(int i=0;i<testCases;i++)
        {
          //  System.out.print("Enter input A B: ");
            input[i][0] = sc.nextInt();
            input[i][1] = sc.nextInt();
            
        }
  

for(int k=0;k<testCases;k++){
      ctr = 0;
      A = input[k][0];
      B = input[k][1];
        for(int i = A;i<=B;i++){
            int num = i;
            int nMul = 1;
            int mul = 1; 
            int tnum = num/10;
            while(tnum > 0){
                mul = mul *10;
                tnum= tnum/10;
            }
            tnum = num;
            int n = 0;
            while(tnum > 0 && mul >= 10){
                nMul = nMul * 10;
                n = (num % nMul) * mul + (num / nMul);
                mul = mul / 10;
                tnum = tnum / 10;
                for(int m=num;m<=B;m++){
                    
                    if(n == m && m > num){
                        ctr++;
                    }
                }
                
                
                
         
            }
        }
        System.out.println("Case #"+(k+1)+": "+ctr);
        
    }
    }
}

import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;


public class GoogleRecycler {
	public static void main(String args[]) throws IOException{
		Scanner scan = new Scanner(System.in);
		PrintWriter print = new PrintWriter(new FileWriter("GoogleRecycler.out"));
		Integer cases = Integer.parseInt(scan.nextLine());
		for(int i=0; i<cases; i++){
			long A = scan.nextLong();
			long B = scan.nextLong();
//			System.out.println("A: " + A + " B: " + B);
			int total = 0;
			
			for(long n = A; n < B; n++){
				for(long m = n+1; m <= B; m++){
					//System.out.println(n + ", " + m);
					if(check(n,m)){
						total++;
//						System.err.println(n + ", " + m );
					}
				}
			}
			print.println("Case #" + (i+1) + ": " + total);
			System.out.println("Case #" + (i+1) + ": " + total);
			
		}
		print.flush();
		print.close();
	}

	public static boolean check(long a, long b){
		String num1 = String.valueOf(a);
		String num2 = String.valueOf(b);
		
		if(num1.length() != num2.length()){
			System.err.println("ERROR!!!!!");
		}

		String part1 = "";
		String part2 = "";
		for(int i=0; i < num2.length(); i++ ){
			String sub = num2.substring(0,i);
			if(num1.contains(sub)){
				part1 = sub;
			}else{
				break;
			}
		}
		for(int i=part1.length(); i<= num1.length();i++){
			String sub = num2.substring(part1.length(), i);
			if(num1.contains(sub)){
				part2 = sub;
			}else{
				break;
			}
		}

		if(part1.length() + part2.length() != num1.length()){
			return false;
		}

		if(part2.concat(part1).equals(num1)){
			return true;
		}

		return false;
	}
}
