import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}


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;

    }
}
