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

package Happy;
import java.io.*;
import java.math.*;
import java.lang.*;
import java.util.*;
import java.util.Arrays.*;
import java.io.BufferedReader;
//import java.io.IOException;
//import java.io.InputStreamReader;
//import java.io.PrintWriter;
//import java.util.StringTokenizer;

/**
 *
 * @author ipoqi
 */
public class Happy {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        new Happy().haha();
    }

    public void haha() {
        BufferedReader in = null;
        BufferedWriter out = null;
        try{
            in = new BufferedReader(new FileReader("C-large.in"));
            out = new BufferedWriter(new FileWriter("LLL.out"));
            int T = Integer.parseInt(in.readLine());
            System.out.println("T="+T);

            //LinkedList<Integer> mm = new LinkedList<Integer>();
            //mm.add(new LinkedList<Integer>());
           //int[][] mm;
           //for(int ii=0;ii<mm.length;ii++){
           //     mm[0][ii] = 1;
           //}


            for(int i=0;i<T;i++){
                String[] line = in.readLine().split(" ");
                int A = Integer.parseInt(line[0]);
                int B = Integer.parseInt(line[1]);
                //System.out.print(" A = "+A+"\n");
                //System.out.print(" B = "+B+"\n");

                int ans = 0;

                
                for(int j=A;j<B;j++){
                    int n=j;
                    if(n>=10){
                        String N = Integer.toString(n);
                        int nlen = N.length();
                        List<Integer> oks = new ArrayList<Integer>();
                        for(int k=0;k<nlen-1;k++){
                            String M = "";
                            for(int kk=1;kk<=nlen;kk++){
                                 M = M + N.charAt((k+kk)%nlen);
                            }
                            int m = Integer.parseInt(M);
                            //System.out.print(" N = "+N+"\n");
                            //System.out.print(" M = "+M+"\n");

                            if(m>n && m<=B) {
                                boolean isNewOne = true;
                                for(int kkk=0;kkk<oks.size();kkk++){
                                    //System.out.print(" KKK = "+oks.get(kkk)+"\n");
                                    if(m==oks.get(kkk)){
                                        isNewOne = false;
                                    }
                                }
                                if(isNewOne){
                                    //System.out.print(" N = "+N+"\n");
                                    //System.out.print(" M = "+M+"\n");
                                    oks.add(m);
                                    ans++;
                                }
                            }
                        }
                    }
                }
                out.write("Case #"+(i+1)+": "+ans+"\n");
                System.out.print("Case #"+(i+1)+": "+ans+"\n");
            }
            in.close();
            out.close();
        }catch(Exception e){
            e.printStackTrace();
            try{
                in.close();
                out.close();
            }catch(Exception e1){
                e1.printStackTrace();
            }
        }
        System.out.print("YES!\n");
    }

}

import java.util.*;
import java.io.*;

public class template {

    private StringBuilder result = new StringBuilder();
    
    public static void main(String[] args) {
        new template().go();
    }

    public void go() {

        File inputFile = new File("/Users/amornchaikanokpullwad/Documents/input.in");
        BufferedReader br = null;

        try {
            br = new BufferedReader(new FileReader(inputFile));
            int numTests = Integer.parseInt(br.readLine());
            
            for (int testCounter = 0; testCounter < numTests; ++testCounter) {
                int count = 0;
                String text[] = br.readLine().split(" ");
                long A = Long.parseLong(text[0]);
                long B = Long.parseLong(text[1]);
                for (long i = A; i <= B; i++) {
                    for (int j = 1; j < Long.toString(i).length(); j++) {
                        //System.out.println(j + " " + i);
                        long temp = reverse(Long.toString(i),j);
                        if (temp <= i) continue;
                        if (temp <= B) {
                            //System.out.println(i+"+"+B);
                            count++;
                        }
                    }
                    
                    
                    //System.out.println(i+"+"+B);
                    
                    
                    
                }
                appendResult(testCounter, count);
            }
        } catch (FileNotFoundException fe) {
            fe.printStackTrace();
        } catch (IOException ie) {
            ie.printStackTrace();
        } finally {
            try {
                if (br != null) {
                    br.close();
                }
            } catch (IOException ex) {
                ex.printStackTrace();
            }
        }
        writeResultToFile();
        //System.out.println(result);
    }

    private void appendResult(int testCase, int outp) {

        result.append("Case #" + (testCase+1) + ": ");
        result.append(outp+"");

        result.append("\n");
    }

    private void writeResultToFile() {
        PrintWriter pr = null;

        try {
            pr = new PrintWriter(new File("/Users/amornchaikanokpullwad/Documents/output.in"));
            pr.print(result);

        } catch (FileNotFoundException e) {
            e.printStackTrace();
        } finally {
            if (pr != null) {
                pr.close();
            }
        }
    }
    
    private long reverse(String in,int le){
       
        StringBuilder temp = new StringBuilder();
        for (int i = le; i > 0; i--) {
            //System.out.println(in);
            temp.append(in.charAt(in.length()-i));
            
        }
        for (int i = 0; i < in.length()-le; i++) {
            temp.append(in.charAt(i));
        }
        return Long.parseLong(temp.toString());
    }
}