/*
 * 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.*;

public class C {

    public static void main(String args[]){
        Scanner scanner = new Scanner(System.in);
        int testCount = scanner.nextInt();
        HashSet<String> hashResult = new HashSet<String>();
        for (int test = 1; test <= testCount; test++){
            int min = scanner.nextInt();
            int max = scanner.nextInt();
            int total=0;
            for (Integer i=min; i<=max;i++){
                char[]numChar= i.toString().toCharArray();
                for (int k=0; k<=numChar.length-1;k++){

                    // Move ponteiro
                    char charTemp=numChar[numChar.length-1];
                    for (int j=numChar.length-2;j>=0;j--){
                        numChar[j+1]=numChar[j];
                    }
                    numChar[0]=charTemp;
                    Integer result = Integer.parseInt(new String(numChar));
                    if(i<result && result <=max) {
                        hashResult.add(i.toString()+result.toString());
                        total+=1;
                    }

                }

            }
            System.out.println("Case #" + (test) + ": "+hashResult.size());
            hashResult.clear();
        }
    }

}
