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();
        }

    }
}

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

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 *
 * @author yondaime
 */
public class JavaApplication3 {

    static int A = 1111;
    static int B = 2222;

    public static int[] permute(int n) {

        String chaine = n + "";
        int tailleChaine = chaine.length();
        int nombre;
        String g = "";
        for (int i = 0; i < tailleChaine; i++) {
            g += "1";
        }
        nombre = Integer.parseInt(g);
        if (chaine.length() < 1 || n % nombre == 0) {
            int[] t = new int[1];
            t[0] = n;
            return t;
        }
        int table[] = new int[10];

        for (int i = 0; i < tailleChaine - 1; i++) {
            String t = "";
            t = chaine.substring(i + 1);
            t += chaine.substring(0, i + 1);
            int m = Integer.parseInt(t);
            if (m > n && n >= A && m <= B) {
                table[i] = m;
//                System.out.println(table[i]);
            }
        }

//        System.out.println("end");
//
        int m = Integer.parseInt(chaine);

        return table;
    }
    static int count;

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

        Scanner sc = new Scanner(new File("C-large.in"));
        PrintWriter out = new PrintWriter(new File("C-large.out"));
        sc.next();
        int kl=0;
        while (sc.hasNext()) {
            
            A = sc.nextInt();
            B = sc.nextInt();
            out.print("Case #"+(++kl)+":");
//            out.print(" "+B);
            for (int n = A; n < B; n++) {
                int mm[] = permute(n);
                for (int k = 0; k < mm.length; k++) {
                    int m = mm[k];
                    // n doit etre < Ã  m
                    //n doit etre > Ã  A et m doit etre inferieur Ã  B
                    // A <= n < m <= B
                    if (n >= m || A > n || m > B) {
                        continue;
                    }
                    count++;
//                    out.print("n = " + n + " m = " + m);
                }


            }
            out.println(" " + count);
            count=0;

        }
        out.close();
        sc.close();
    }
}
