/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumbers;

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}


import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class RecycledNo {

    Scanner in;
    BufferedWriter out;

    RecycledNo(String input, String output) throws Exception {
        in = new Scanner(new File(input));
        FileWriter fstream = new FileWriter(output);
        out = new BufferedWriter(fstream);
    }

    private void solveAll() throws IOException {
        int T = in.nextInt();
        int A, B;

        for (int test = 1; test <= T; test++) {
            A = in.nextInt();
            B = in.nextInt();
            out.write("Case #" + test + ": " + solve(A, B));
            out.newLine();
        }

    }

    private int solve(int A, int B) {
        int count = 0, dig, pow10, lastPart, firstPart, exp10, newNo;
        int noDig = 1 + (int) Math.log10(A);
        Set<Integer> set = new HashSet<Integer>();

        for (int n = A; n < B; n++) {
            set.clear();
            pow10 = 1;
            lastPart = 0;
            firstPart = n;
            exp10 = (int) Math.pow(10, noDig - 1);
            
            for (dig = 1; dig < noDig; dig++) {
                lastPart = (firstPart % 10) * pow10 + lastPart;
                firstPart = firstPart / 10;
                pow10 *= 10;

                newNo = lastPart * exp10 + firstPart;
                exp10 /= 10;
                if ((int) Math.log10(newNo) != noDig - 1) {
                    continue;
                }

                if (newNo > n && newNo <= B &&
                        !set.contains(newNo)) {
                    set.add(newNo);
                    count++;
                }
            }
        }

        return count;
    }

    public void close() throws IOException {
        in.close();
        out.close();
    }

    public static void main(String[] args) throws Exception {
        RecycledNo pb = new RecycledNo("input.txt", "output.txt");

        pb.solveAll();

        pb.close();
    }
}
