/*
 * 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.*;
import java.io.*;
class Try{
	
	public static int equate(String currentNumber, String reversibleNumber){
		int count=0;
		char splitPoint = currentNumber.charAt(0);
		for (int i=0;i<reversibleNumber.length();i++){
			if (reversibleNumber.charAt(i)==splitPoint){
				//we've found our pivot
				int start = i;
				String reversedWord="";
				for (int j=0;j<reversibleNumber.length();j++){
					 reversedWord+=reversibleNumber.charAt((start+j)%reversibleNumber.length());
				}
				if (reversedWord.equals(currentNumber)){
					count=1;
					break; //test
				}
			}
		}
		return count;
	}
	
	public static void main(String[] args){
		Scanner file = null;
		try{
			file = new Scanner(new FileInputStream(args[0]));
		}
		catch(Exception e){
			System.out.println(e);
			System.exit(0);
		}
		int inputSize = Integer.parseInt(file.nextLine());
		Node[] limits = new Node[inputSize];
		for (int i=0;i<inputSize;i++){
			String[] line = file.nextLine().split(" ");
			limits[i] = new Node(Integer.parseInt(line[0]),Integer.parseInt(line[1]));
		}
		int Case=1;
		for (Node Interval:limits){
			int count=0;
			int min = Interval.getMin();
			int max = Interval.getMax();
	
			for (int i=min;i<=max;i++){
				
				for (int j=min;j<=max;j++){
					if (j!=i){
						count+=equate(i+"",j+"");
					}
				}
			}
			System.out.println("Case #"+Case+": "+(count/2));
			Case++;
		}
	}
}
