/*
 * 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.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Scanner;

public class C
{
    Scanner in;
    PrintWriter out;
    PrintStream err;
    
    private boolean recycled(int x, int y) {
    	String s1 = Integer.toString(x);
    	String s2 = Integer.toString(y);
    	if (s1.length() != s2.length())
    		return false;
    	for (int i = 0; i < s1.length(); ++i)
    		if (s1.equals(s2.substring(i) + s2.substring(0, i)))
    			return true;
    	return false;
    }
 
    private void run() throws Exception
    {
    	//in  = new Scanner(System.in);
    	//out = new PrintWriter(System.out);
        //in = new Scanner(new FileInputStream(		new File("input")));
        in = new Scanner(new FileInputStream(		new File("C-small-attempt0.in")));
        //in = new Scanner(new FileInputStream(		new File("X-large.in")));
        out = new PrintWriter(new FileOutputStream(	new File("output")));
        err = System.out;

        int testCases = in.nextInt();

        for (int test = 1; test <= testCases; ++test) {
        	int a = in.nextInt();
        	int b = in.nextInt();
        	int result = 0;
        	for (int i = a; i <= b; ++i)
        		for (int j = i+1; j <= b; ++j)
        			if (recycled(i, j))
        				result++;
        	out.println("Case #" + test + ": " + result);
        }
        out.close();
    }

    public static void main(String[] args) throws Exception
    {
        new C().run();
    }
}