package Main;

import com.sun.deploy.util.ArrayUtil;
import org.apache.commons.lang3.ArrayUtils;

import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;

/**
 * Created with IntelliJ IDEA.
 * User: arran
 * Date: 14/04/12
 * Time: 3:12 PM
 * To change this template use File | Settings | File Templates.
 */
public class Round {
    public StringBuilder parse(BufferedReader in) throws IOException {
        StringBuilder out = new StringBuilder();
        String lineCount = in.readLine();

        for (int i = 1; i <= Integer.parseInt(lineCount); i++)
        {
            out.append("Case #"+i+": ");
            System.err.println("Case #"+i+": ");
            String line = in.readLine();
            String[] splits = line.split(" ");
            int p1 = Integer.valueOf(splits[0]);
            int p2 = Integer.valueOf(splits[1]);
            int r = pairRecyclable(p1, p2);
            out.append(r);

//            if (i < Integer.parseInt(lineCount))
                out.append("\n");
        }
        return out;
    }

    public static int pairRecyclable(int i1, int i2) {
        HashSet<String> hash = new HashSet<String>();
        for (int i = i1; i < i2; i++)
        {
            String istr = String.valueOf(i);
            if (istr.length() < 2) continue;
            for (int p = 0; p < istr.length() ; p++)
            {
                String nistr = istr.substring(p,istr.length()).concat(istr.substring(0,p));
                if (Integer.valueOf(nistr) < i1) continue;
                if (Integer.valueOf(nistr) > i2) continue;
                if (nistr.equals(istr)) continue;
                String cnistr = (Integer.valueOf(nistr) > Integer.valueOf(istr)) ?  istr + "," + nistr : nistr + "," + istr;
                hash.add(cnistr);
            }
        }
        return hash.size();
    }

    public static void main(String[] args) {
        InputStreamReader converter = null;
        try {
            int attempt = 0;
            String quest = "C";
//            String size = "small-attempt";
            String size = "large";
            converter = new InputStreamReader(new FileInputStream("src/resource/"+quest+"-"+size+".in"));
            BufferedReader in = new BufferedReader(converter);
            Round r = new Round();
            String str = r.parse(in).toString();
            System.out.print(str);
            FileOutputStream fos = new FileOutputStream(quest+"-"+size+".out");
            OutputStreamWriter osw = new OutputStreamWriter(fos);
            BufferedWriter bw = new BufferedWriter(osw);
            bw.write(str);
            bw.flush();
            bw.close();
        } catch (IOException e) {
            e.printStackTrace();
        }

    }
}

import java.util.*;
import java.io.*;
import java.lang.Integer;


public class QuestionC
{

    public static void main(String[] args) throws IOException
    {

        Scanner inPut = new Scanner(new File("C-large.in"));
        FileWriter fWriter = new FileWriter("C-large.out");
        int caseTotal = inPut.nextInt();
        inPut.nextLine();
        for (int caseNum = 1; caseNum <= caseTotal; caseNum++)
        {

            // read the string length for this case
            int base = 1;
            int smallNum = inPut.nextInt();
            int largeNum = inPut.nextInt();
            int digit = 0;
            int temp = smallNum;
            while(temp != 0)
            {
                temp = temp/10;
                digit++;
            }
            int[] num = new int[digit];
            int total = 0;

            for (int i = 1; i < digit; i++)
            {
                base = base * 10;
            }
            fWriter.write("Case #" + caseNum + ": ");
            for(int i = largeNum; i >= smallNum; i--)
            {
                num[0] = i;

                for (int j = 1; j < digit; j++)
                {
                    boolean norepeat = false;
                    num[j] = num[j - 1] / base + (num[j - 1] % base) * 10;

                    if (num[j] >= smallNum && num[j] <= largeNum)
                    {
                        norepeat = true;
                        for (int k = j - 1; k >= 0; k--)
                        {
                            norepeat = norepeat && (num[j] != num[k]);
                        }
                    }
                    if(norepeat) total++;
                }
            }
            total = total / 2;
            fWriter.write(total + "\n");
        }
        fWriter.flush();
        fWriter.close();
    }
}
