/*
 * 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.*;
import java.lang.*;

public class Recycled {
	public static int cases = 0;
	public static int min[] = new int[50];
	public static int max[] = new int[50];
	public static int answer[] = new int[50];
	public static ArrayList<Integer> results = new ArrayList<Integer>();

	public static void main(String args[]) {
		File input = new File("Input.txt");
		File output = new File("Output.txt");
		loadGame(input);
		for(int i = 0; i < cases; i++){
			answer[i] = 0;
		}
		findAnswer();
		saveGame(output);
	}
	
	public static void findAnswer(){
		for(int i = 0; i < cases; i++){
			for(int j = min[i]; j <= max[i]; j++){
				String number = new Integer(j).toString();
				ArrayList<String> numberArray = new ArrayList<String>();
				for(int m = 0; m < number.length(); m++){
					numberArray.add(Character.toString(number.charAt(m)));
				}
				for(int k = 1; k < number.length(); k++){
					numberArray.add(0, numberArray.remove((number.length()-1)));
					String temp = "";
					ArrayList<String> tempNumberArray = new ArrayList<String>();
					tempNumberArray.addAll(numberArray);
					for(int m = 0; m < number.length(); m++){
						temp += tempNumberArray.remove(0);
					}
					int result = Integer.parseInt(temp);
					if(result >= min[i] && result <= max [i] && result > j){
						if(!results.contains(result)){
						answer[i]++;
						results.add(result);
						}
					}
				}
				results.clear();
			}
		}
	}
	
	public static void loadGame(File input){
		Scanner in;
		try {
			in = new Scanner(input);
			cases = in.nextInt();
			in.nextLine();
			for(int i = 0; i < cases; i++){
				min[i] = in.nextInt();
				max[i] = in.nextInt();
				if(min[i] > max[i]){
					int temp = min[i];
					min[i] = max[i];
					max[i] = temp;
				}
				in.nextLine();
			}
			in.close();
		}
		catch (StringIndexOutOfBoundsException e) { }
		catch (FileNotFoundException e) { }
		catch (NoSuchElementException e) { } 
		catch (NullPointerException e) { }
	}

	public static void saveGame(File name){
		PrintWriter out;
		try {
			out = new PrintWriter(name);
			for(int i = 1; i <= cases; i++){
				out.println("Case #" + i + ": " + answer[(i-1)]);
			}  
			out.close();
		}
		catch (FileNotFoundException e) { }
		catch (NullPointerException e) { }
	}

}