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.io.*;
import java.util.*;

public class recycle{
    static class pair{
        int a,b;
        @Override
        public int hashCode(){ return a^b;}
        @Override
        public boolean equals(Object o){
            pair p = (pair)o;
            return p.a == a && p.b == b;
        }
    }

    public static void main(String args[]) throws Exception{
        Scanner s=  new Scanner(System.in);
        int nu= s.nextInt(); s.nextLine();
        int casen=1;while (nu-->0){
        
            int A = s.nextInt(); int B = s.nextInt(); 
                try{s.nextLine();}catch(Exception e){}
            Set<pair> pairs = new HashSet<pair>();
            long num=0;
            for (int i= A; i <=B;i++){
                int k=i;
                int digits = 0; int mult = 1;
                while (k>0){ digits++; k/=10; mult *= 10; }

                k=i; int sum = 0; 
                int m2 = 1;
                while (k>0){
                    sum += m2*(k%10);
                    boolean zero =k%10 == 0;
                    mult/=10;
                    k/=10;
                    int a = i;
                    int b = sum*mult+k;
                    if (!zero && b >= A && b <= B && a!=b){
                            pair p = new pair();
                            p.a = b; 
                            p.b = i;
                        if(!pairs.contains(p)) {
                            p.a = i; p.b=b;
                            if (!pairs.contains(p)){
                            num++;pairs.add(p);
                         //   System.out.println(p.a + "-"+p.b);
                            }
                        }
                    }
                    m2*=10;
                }
            }
            System.out.println("Case #"+casen++ +": "+ num);
       } 
    }
}
