/*
 * 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.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.util.HashSet;

public class ProblemB {
	static HashSet<String> pairs = new HashSet<String>();

	public static void main(String args[]) {
		ReadInFile();
	}

	private static void ReadInFile() {
		try {

			FileWriter ofstream = new FileWriter("c:/cygwin/out.txt");
			BufferedWriter out = new BufferedWriter(ofstream);

			// Open the file that is the first
			// command line parameter
			FileInputStream fstream = new FileInputStream(
					"c:/cygwin/C-small-attempt1.in");
			// Get the object of DataInputStream
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			// Read File Line By Line
			int i = 0;
			strLine = br.readLine();
			while ((strLine = br.readLine()) != null) {
				pairs.clear();
				// Print the content on the console
				System.out.println(strLine);

				String[] tokens = strLine.split("\\s+");

				System.out.println("Case #"
						+ (++i)
						+ ": "
						+ ReturnCount(Integer.parseInt(tokens[0]),
								Integer.parseInt(tokens[1])));

				out.write("Case #"
						+ (i)
						+ ": "
						+ ReturnCount(Integer.parseInt(tokens[0]),
								Integer.parseInt(tokens[1])) + "\n");

			}
			// Close the input stream
			in.close();
			out.close();

		} catch (Exception e) {// Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
	}

	static int ReturnCount(int n, int m) {
		HashSet<Integer> cycles = new HashSet();
		for (int i = n; i <= m; i++) {
			// if (!cycles.contains(i))
			cycles.addAll(GetCycles(i, n, m));
		}

		return pairs.size();
	}

	static private HashSet<Integer> GetCycles(int in, int n, int m) {
		String s = String.valueOf(in);
		HashSet<Integer> out = new HashSet<Integer>();
		for (int i = 0; i < s.length(); i++) {
			String sub1 = s.subSequence(0, i + 1).toString();
			String sub2 = s.subSequence(i + 1, s.length()).toString();

			int permutation = Integer.parseInt(sub2 + sub1);
			out.add(permutation);
		}

		for (int i : out)
			if (i >= n && i <= m && i > in) {
				pairs.add(in + "," + i); // return out;
			}

		return out;
	}
}
