/*
 * 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.File;
import java.util.*;

public class ProblemC {

	
	public static void main(String[] args) throws Exception  {

		Scanner sc = new Scanner(new File("C:\\C-small-attempt0.in"));
		//Scanner sc = new Scanner(System.in);
		int cases = Integer.parseInt(sc.nextLine().trim());
		for(int i = 0; i < cases; i++){
			int a = sc.nextInt();
			int b = sc.nextInt();
			System.out.println("Case #" + (i + 1) + ": " + solve(a,b));
		}
	}

	
	private static int solve(int a, int b) {
		int [][]vis = new int[b + 1][b + 1];
		int count = 0;
		
		for(int i = a; i <= b; i++){
			int []arr = getPair(i);
			
			for(int j : arr){
				if((j >= a) && (j <= b) && (i != j) && vis[i][j] != 1){
					vis[i][j] = 1;
					vis[j][i] = 1;
					//System.out.println(i + " " + j);
					count++;
				}
			}
		}
		return count;
	}


	private static int[] getPair(int i) {
		int []ret = new int[]{};
		
		String str = String.valueOf(i);
		if(str.endsWith("0")){
		}
		else if(i < 10){
		} else if (i < 100){
			int a1 = i %10;
			int a2 = i/10;
			int a3 = a1*10 + a2;
			ret = new int[]{a3};
		} else if (i <= 1000){
			int a1 = i % 10;
			int a2 = ((i - a1)/10) % 10;
			int a3 = i/100;
			
			int a4 = a1*100 + a3*10 + a2;
			int a5 = a2*100 + a1*10 + a3;
			
			ret = new int[]{a4,a5};
		}
		return ret;
	}
}
