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


package recycledNumbers;

import java.util.*;

public class RecycledNumbers 
{
	public int countRecylcedNumbers(int x, int y )
	{
		
		int count =0;
		int m=x+1;
		ArrayList<ArrayList<String>>  arrayList= new ArrayList<ArrayList<String>>();
		ArrayList<String> list = new ArrayList<String>();
		for(int i=0;i<y;i++)
		{
			
			arrayList.add(null);
		}
		boolean flag = true;;
		for(int i=m;i<=y;i++)
		{
			int[] array = recycledNumber(i);
			list = new ArrayList<String>();
			for(int j=0;j<array.length;j++)
			{
				
				if(array[j]<=y && array[j]!=i && array[j]!=0 && array[j]>=x)
				{
					flag = true;
					if(i==m)
					{
						System.out.println(i + "    " + array[j]);
						count++;
						list.add(new Integer(array[j]).toString());
					}
					else
					{
						ArrayList<String> searchList= arrayList.get(array[j]);
						if(searchList!= null)
						{
							for(int k=0;k<searchList.size();k++)
							{
								if(Integer.parseInt(searchList.get(k))==i)
								{
									flag = false;
								}
							}
						}
						if(flag != false)
						{
							System.out.println(i + "    " + array[j]);
							count++;
							list.add(new Integer(array[j]).toString());
						}
						
					}
				}
			}
			arrayList.add(i, list);
		}
		System.out.println(count);
		return count;
	}
	public int digitCount(int x)
	{
		int count=0;
		while(x!=0)
		{
			x/=10;
			count++;
		}
		return count;
		
	}
	
	public int[] recycledNumber(int x)
	{
		int y, count = 0;
		count = digitCount(x);
		y=count-1;
		int place;
		int lastInt;
		int[] array = new int[y];
		int i=0;
		while(y!=0)
		{
			place = (int) Math.pow(10, count-1);
			lastInt = x%10;
			x/=10;
			x=lastInt*place + x;
			if(digitCount(x)==count)
			{
				array[i++]=x;
			}
			y--;
		}
		return array;
	}
}
