/*
 * 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.util.HashSet;
import java.util.Scanner;
import java.util.Set;


public class Solution {
	
	public static void main(String[] args)
	{
		Scanner s = new Scanner(System.in);
		int size = s.nextInt();
		for (int count = 1; count <= size; count++){
			
			int lowB = s.nextInt();
			int highB = s.nextInt();
			int pairCount = 0;
			int bits = (lowB+"").length();
			int mod = (int)Math.pow(10, (bits-1));
			Set<Integer> seen = new HashSet<Integer>();
			//System.out.println("(" + lowB + ", " + highB + "), " + "bits = " + bits + ", mod = " + mod);
			for (int i = lowB; i <= highB; i++){
				 
				int num1 = i;
				int num2 = i;
				seen.clear();
				for (int j = 1; j < bits; j++){
					int div = num2 / mod;
					int modular = num2 % mod;
					num2 = modular * 10 + div;
					
					if (num2 < lowB || num2 <= num1 || num2 > highB || seen.contains(num2)) continue;
					//System.out.println("(" + num1 + ", " + num2 + ")");
					pairCount++;
					seen.add(num2);
				}
			}
		System.out.println("Case #" + count+ ": " + pairCount);	
		}
		
		
		
	}

}
