/*
 * 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;
        } 
    
}


/*
 * @author Magix.Lu
 */
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

public class RecycledNum {
	public static void main(String[] args) throws IOException {
		Scanner scanInput = new Scanner(System.in);
		String target = scanInput.next();

		File inputFile = new File(target);
		Scanner fileScan = new Scanner(inputFile);

		String outpFileName = "output.txt";
		FileWriter googlewriter = null;
		googlewriter = new FileWriter(outpFileName);

		PrintWriter diskFile = new PrintWriter(googlewriter);

		int count = fileScan.nextInt();
		int min = 0;
		int max = 0;
		int len = 0;

		int a = 0;
		int b = 0;

		int counter = 0;

		for (int i = 0; i < count; i++) {
			min = fileScan.nextInt();
			max = fileScan.nextInt();

			a = min;
			len = Integer.toString(a).length();
			counter = 0;

			if (len == 1) {
				diskFile.print("Case #" + (i + 1) + ": " + counter + "\n");

				System.out.println(counter);
			} else {
				while (a <= max) {
					b = a;
					String num = Integer.toString(b);

					for (int j = 0; j < len - 1; j++) {

						if (len == 2) {
							String result = Character.toString(num.charAt(1))
									+ num.charAt(0);

							num = result;
							b = Integer.parseInt(result);
						}

						else {

							String front = Character.toString(num.charAt(num
									.length() - 1));
							String behind = num.substring(0, num.length() - 1);

							String result = front + behind;

							num = result;
							b = Integer.parseInt(num);
						}

						if (min <= a && a < b && b <= max) {
							counter++;
							System.out.println(a + "	" + b);
						}

					}

					a++;
				}
				diskFile.print("Case #" + (i + 1) + ": " + counter + "\n");
				System.out.println(counter);
			}
		}

		diskFile.close();

	}

}
