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

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author daniele
 */
public class GCJ_C {
    
    public static void main(String[] args) throws Exception{
        
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        

        int prove=in.nextInt();
        int min,max;
        int cifre;
        int cifreaus;
        String temp;
        int aus;
        int count=0;
        ArrayList<Integer> vals = new ArrayList<Integer>();
        int jcount=0;
        ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            
            out.append("Case #" +i+": ");out.flush();
            
            min=in.nextInt();
            max=in.nextInt();
            
            for(int j=min;j<=max;j++){
               if(!vals.contains(j)){
                    temp=""+j;
                    cifre=temp.length();
                    aus=j;
                    perm.add(j);
                    for(int k=1;k<cifre;k++){
                        aus=rotateOnce(aus);
                        temp=""+aus;
                        cifreaus=temp.length();//elusione zeri iniziali
                        if(aus>=min && aus<=max && aus!=j && cifreaus==cifre && nobody(vals,perm)){ 
                            perm.add(aus);
                            jcount ++;
                            
                        }
                        
                    }
                    while(jcount>0){count+=jcount; jcount--;}
                    vals.addAll(perm);
                    perm= new ArrayList<Integer>();
                    
                }
            }
            out.append(count+"\n");out.flush();
            count=0;
            vals= new ArrayList<Integer>();
        }
        
        
        
    }
        static public int rotateOnce(int n){
            String s=""+n;
            if(s.length()>1){
                s=s.charAt(s.length()-1) + s.substring(0,s.length()-1);
                n=Integer.parseInt(s);
            }
            return n;
        }    
        
        static public boolean nobody(ArrayList<Integer> v,ArrayList<Integer> a){;
            for(int i=0;i<a.size();i++)
                if(v.contains(a.get(i))) return false;
            return true;
        } 
    
}



import java.io.*;
import java.util.HashSet;
import java.util.StringTokenizer;

public class Main {

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

        String file = "C-small-attempt0";
        BufferedReader in = new BufferedReader(new FileReader(file + ".in"));
        FileWriter archivo = new FileWriter(file+".out");
        PrintWriter outs = new PrintWriter(archivo);
        outs.flush();
        //BufferedReader in = new BufferedReader(new InputStreamReader(System.in));

        int n = Integer.parseInt(in.readLine());
        for (int i = 1; i <= n; i++) {
            HashSet<String> k = new HashSet<String>();
            StringTokenizer token = new StringTokenizer(in.readLine());
            int a = Integer.parseInt(token.nextToken()), b = Integer.parseInt(token.nextToken());
            for (int j = a; j <= b; j++) {
                String r = String.valueOf(j);
                if (j < 100) {
                    String test1 = new StringBuilder(r).reverse().toString();

                    if (!r.equals(test1)) {
                        int comparer = Integer.parseInt(test1);

                        if (a <= comparer && comparer <= b) {
                            //System.out.println(comparer);
                            int lol = Integer.parseInt(r);
                            String container = Math.max(comparer, lol) + " - " + Math.min(comparer, lol);
                            //System.out.println(container);
                            if (!k.contains(container)) {
                                k.add(container);
                            }
                        }
                    }
                } else {
                    //System.out.println(r.length());
                    for (int c = 1; c < r.length(); c++) {

                        String test1 = r.substring(c);
                        String test2 = r.substring(0, c);
                        //System.out.println(test1+test2);
                        if (!r.equals(test1 + test2)) {
                            int comparer = Integer.parseInt(test1+test2);

                            if (a <= comparer && comparer <= b) {
                                //System.out.println(comparer);
                                int lol = Integer.parseInt(r);
                                String container = Math.max(comparer, lol) + " - " + Math.min(comparer, lol);
                                //System.out.println(container);
                                if (!k.contains(container)) {
                                    k.add(container);
                                }
                            }
                        }

                    }
                }
            }
            outs.println("Case #" + i + ": " + k.size());
        }





        outs.close();
        in.close();
        System.exit(0);

    }
}
