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.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.Scanner;
import java.util.Set;
import java.util.regex.Pattern;


public class ProblemC {

	public static void main(String[] args) {

		Scanner input;
		try {
			input = new Scanner(new FileReader("C-large.in"));
			PrintWriter output = new PrintWriter(new FileWriter("output3.txt"));

			int numberCases = input.nextInt();
			String data = input.nextLine();

			for (int i = 0; i < numberCases; i++) {
				output.print("Case #" + (i + 1) + ": ");

				data = input.nextLine();
				String[] intS = Pattern.compile(" ").split(data);
				int[] numbers = new int[intS.length];
				for (int j = 0; j < intS.length; j++) {
					numbers[j] = Integer.parseInt(intS[j]);
				}

				int lowerBound = numbers[0];
				int upperBound = numbers[1];
				output.print(calculatePossibilities(lowerBound, upperBound));
				output.print("\n");
			}

			output.flush();
			output.close();
			input.close();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}

	public static int calculatePossibilities(int lowerBound, int upperBound) {

		//Set allPossibilities = new HashSet();
		int numberDigits = (int) (Math.floor(Math.log10(lowerBound))) + 1;
		int currentNumber = 0;
		int lowPart = 0;
		int counter = 0;
		int highPart = 0;
		//System.out.println("Digits " + numberDigits);
		for (int j = lowerBound; j <= upperBound; j++) { 
			Set permutations = new HashSet();
			for (int i = 1; i <= numberDigits - 1; i++) {
				lowPart = j % ((int) Math.pow(10, i));
				highPart = j / ((int) Math.pow(10, i));
				currentNumber = (lowPart * (int) Math.pow(10, numberDigits - i)) + highPart;
				//System.out.println(currentNumber + " <- j: " + j + " i:" + i + "  low " + lowPart + " high " + highPart);
				
				if (currentNumber >= lowerBound && currentNumber <= upperBound &&
						currentNumber > j) {
					permutations.add(currentNumber);
				}
				//if (!permutations.isEmpty())
					//allPossibilities.add(permutations);
			}
			counter = counter +  permutations.size();
		}

		//System.out.println("A: " + allPossibilities.size());
		return counter;
	}
}
