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

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}

import java.io.*;

public class RecycledNumbers {

    public static void main(String[] args) {
        BufferedReader reader = null;
        PrintWriter writer = null;

        try {
            reader = new BufferedReader(new FileReader(new File("src/C-small-attempt0.in")));
            writer = new PrintWriter(new BufferedWriter(new FileWriter(new File("src/C-small-attempt0.out"))));

            String line = reader.readLine();
            boolean seenFirstLine = false;
            int caseId = 0;
            while(line != null) {
                if(!seenFirstLine) {
                    seenFirstLine = true;
                }
                else {
                    String[] tokens = line.split(" ");
                    final int A = Integer.parseInt(tokens[0]);
                    final int B = Integer.parseInt(tokens[1]);
                    int numPairs = findNumPairs(A, B);
                    writer.println("Case #" + caseId + ": " + numPairs);
                }
                line = reader.readLine();
                caseId++;
            }
        }
        catch(FileNotFoundException e) {
            e.printStackTrace();
        }
        catch(IOException e) {
            e.printStackTrace();
        }
        finally {
            try {
                reader.close();
                writer.close();
            }
            catch(IOException e) {
                e.printStackTrace();
            }
        }
    }

    static int findNumPairs(final int A, final int B) {
        int numRecycledPairs = 0;
        for (int n=A; n<=B; n++) {
            for (int m = n+1; m<=B; m++) {
                if (isRecycled(n, m)) numRecycledPairs +=1;
            }
        }
        return numRecycledPairs;
    }

    static boolean isRecycled(int n, int m) {
        if(n >= m) {
            throw new IllegalArgumentException("n >= m");
        }
        String nStr = Integer.toString(n);
        String mStr = Integer.toString(m);
        return (mStr + mStr).contains(nStr);
    }
}
