package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}


import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author Chung Lee
 */
public class RecycleNumber {
    
    public static void Main(String[] args) throws FileNotFoundException {

        Scanner scanner = new Scanner(new File(args[0]));
        
        PrintWriter writer = new PrintWriter(args[1]);

        int noCase = scanner.nextInt();

        for (int i = 0; i < noCase; i++) {
            int A = scanner.nextInt();
            int B = scanner.nextInt();

            int noRecyclePair = 0;
            for (int j = A; j <= B; j++) {
                noRecyclePair += getNoRecyclePair(j, A, B);
            }

            noRecyclePair /= 2;

            System.out.print(String.format("Case #%d: %d", i + 1, noRecyclePair));
            writer.print(String.format("Case #%d: %d", i + 1, noRecyclePair));

            if (i != noCase - 1) {
                System.out.println();
                writer.println();
            }
        }
        writer.close();
    }

    public static int getNoRecyclePair(int num, int A, int B) {
        int temp = num;
        int digits = 0;
        while (temp != 0) {
            temp /= 10;
            digits++;
        }

        int noRecyclePair = 0;
        
        
        for (int i = 1; i <= digits; i++) {
            int recycleNum = (int) ((num % Math.pow(10, i)) * Math.pow(10, digits - i)
                    + (num / Math.pow(10, i)));
            if (recycleNum != num
                    && recycleNum >= A
                    && recycleNum <= B) {
                noRecyclePair++;
                    
            }
        }

        return noRecyclePair;

    }
}
