/*
 * 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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class RecycledNumber {

    private int numCase;

    public void calc() throws FileNotFoundException, IOException {

        FileReader reader = new FileReader("D:/C-small-attempt0.in");
        BufferedReader bf = new BufferedReader(reader);

        FileWriter writer = new FileWriter("D:/output.txt");
        BufferedWriter bw = new BufferedWriter(writer);

        numCase = Integer.parseInt(bf.readLine());
        int n, m;
        for (int all = 1; all <= numCase; all++) {
            String[] inp = bf.readLine().split(" ");
            n = Integer.parseInt(inp[0]);
            m = Integer.parseInt(inp[1]);
            int count = 0;
            if (n < 10) {
                count = 0;
            } else if (n < 100) {
                for (int i = n; i <= m; i++) {
                    String temp = i + "";
                    String rv = temp.charAt(1) + "" + temp.charAt(0);
                    if (Integer.parseInt(rv) >= n && Integer.parseInt(rv) <= m && Integer.parseInt(rv) != i) {
//                        System.out.println("I : " + i + " RV : " + rv);
                        count++;
                    }
                }
            } else if (n >= 100 && n <= 999) {
                for (int i = n; i <= m; i++) {
                    String temp = i + "";
                    String rv = temp.charAt(2) + "" + temp.charAt(0) + "" + temp.charAt(1);
                    if (Integer.parseInt(rv) >= n && Integer.parseInt(rv) <= m && Integer.parseInt(rv) != i) {
//                        System.out.println("I : " + i + " RV : " + rv);
                        count++;
                    }
                    rv = temp.charAt(1) + "" + temp.charAt(2) + "" + temp.charAt(0);
                    if (Integer.parseInt(rv) >= n && Integer.parseInt(rv) <= m && Integer.parseInt(rv) != i) {
//                        System.out.println("I : " + i + " RV : " + rv);
                        count++;
                    }
                }
            } else if (n >= 1000 & n <= 9999) {
                for (int i = n; i <= m; i++) {
                    String temp = i + "";
                    String rv = temp.charAt(1) + "" + temp.charAt(2) + "" + temp.charAt(3) + "" + temp.charAt(0);
                    if (Integer.parseInt(rv) >= n && Integer.parseInt(rv) <= m && Integer.parseInt(rv) != i) {
//                        System.out.println("I : " + i + " RV : " + rv);
                        count++;
                    }
                    rv = temp.charAt(2) + "" + temp.charAt(3) + "" + temp.charAt(0) + "" + temp.charAt(1);
                    if (Integer.parseInt(rv) >= n && Integer.parseInt(rv) <= m && Integer.parseInt(rv) != i) {
//                        System.out.println("I : " + i + " RV : " + rv);
                        count++;
                    }
                    rv = temp.charAt(3) + "" + temp.charAt(0) + "" + temp.charAt(1) + "" + temp.charAt(2);
                    if (Integer.parseInt(rv) >= n && Integer.parseInt(rv) <= m && Integer.parseInt(rv) != i) {
//                        System.out.println("I : " + i + " RV : " + rv);
                        count++;
                    }
                }
            }
            System.out.println("Case #" + all + ": " + count / 2);
            bw.write("Case #" + all + ": " + count / 2+"\r\n");
        }
        bw.close();
        writer.close();
        bf.close();
        reader.close();
    }

    public static void main(String[] args) throws FileNotFoundException, IOException {
        RecycledNumber rn = new RecycledNumber();
        rn.calc();
    }
}