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


public class C {

    public static void main(String[] args) {
        boolean[][] isPairs = new boolean[1001][1001];
        for (int i = 1; i < 1000; i++) {
            for (int j = i+1; j < 1001; j++) {
                isPairs[i][j] = isPair(i, j);
            }
        }
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        for (int i = 0; i < t; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            int count = 0;
            for (int j = a; j < b; j++) {
                for (int k = j+1; k <= b; k++) {
                    if (isPairs[j][k]) {
                        count++;
                    }
                }
            }
            System.out.println("Case #" + (i+1) + ": " + count);
            
        }
    }

    private static boolean isPair(int i, int j) {
        int digits = 0;
        int max = 1;
        int ac = i;
        while(ac > 0) {
            ac /= 10;
            digits++;
            max *= 10;
        }
        int min = max / 10;
        for (int k = 0; k < digits; k++) {
            int msb = i / min;
            i = i % min * 10 + msb;
            if (i == j) {
                return true;
            }
        }
        return false;
    }

}
