/*
 * 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.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Scanner;


public class recycled_numbers 
{
	public static class Test
	{
		int a;
		int b;
		String a_str;
		String b_str;
	}
	
	public static boolean contains(ArrayList<Tuple> a,Tuple tuple)
	{
		boolean contain=false;
		for(int i=0;i<a.size();i++)
		{
			if(a.get(i).a==tuple.a && a.get(i).b==tuple.b)
			{
				contain=true;
				break;
			}
		}
		return contain;
	}
	
	public static Test getTest(Scanner a)
	{
		Test test=new Test();
		String str=a.nextLine();
		String str_array[]=str.split(" ");
		test.a_str=str_array[0];
		test.b_str=str_array[1];
		test.a=Integer.parseInt(test.a_str);
		test.b=Integer.parseInt(test.b_str);
		return test;
	}
	
	public static class Tuple
	{
		int a;
		int b;
	}
	
	public static int recycled(Test test)
	{
		int recycle=0;
		ArrayList<Tuple> array=new ArrayList<Tuple>();
		Tuple tuple=new Tuple();
		for(int j=test.a;j<=test.b;j++)
		{
			for(int i=1;i<test.a_str.length();i++)
			{			
				String str=Integer.toString(j).substring(i, test.a_str.length()) + Integer.toString(j).substring(0, i);
				int number=Integer.parseInt(str);
				if(number>=test.a && number<=test.b && number>j)
				{
					tuple.a=j;
					tuple.b=number;
					boolean bool=contains(array,tuple);
					if(!bool)
					{
						Tuple temp=new Tuple();
						temp.a=j;
						temp.b=number;
						recycle++;
						array.add(temp);
					}
				}
			}
		}
		return recycle;
	}
	
	public static void main(String[] args) throws FileNotFoundException 
	{
		Scanner input=new Scanner(new File("C-small-attempt0.in"));
		input.nextLine();
		int i=1;
		while(input.hasNextLine())
		{
			System.out.print("Case #" + i + ": ");
			Test test=getTest(input);
			int number=recycled(test);
			System.out.print(number + "\n");
			i++;
		}
	}
}
