/*
 * 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 cj.sample;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;

public class C2012 {

	BufferedReader br;
	PrintWriter pw;
	
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		C2012 c2012 = new C2012();
		c2012.processInput();		
	}

	public void processInput(){	
		initInFile("/home/Vijitha/GCJ/Testdata/C-small-attempt0.in");
		initOutFile("/home/Vijitha/GCJ/Testdata/C-small-attempt0.out");
		try{
			String l = "";
			// First line
			l = br.readLine();				
			int indx = 1;
			while((l = br.readLine()) != null){				
				String[] ary = l.split(" ");			
				int firstNumber = Integer.parseInt(ary[0]);
				int secondNumber = Integer.parseInt(ary[1]);
				
				int count = getCount(firstNumber, secondNumber);				
				pw.println("Case #" + indx + ": " + count);
				indx++;
			}					
			br.close();		
			pw.close();
		}catch(IOException ex){
			ex.printStackTrace();
		}	
	}  
	
	private int getCount(int firstN, int secondN){		
		int count = 0;	
		
		String firstString = String.valueOf(firstN);
		String secondString = String.valueOf(secondN);
		
		if(firstString.length() != secondString.length())
			return 0;
		
		String fDigit = Character.toString(firstString.charAt(0));
		
		if(firstString.length() == 1)
			return 0;
		
		if(firstString.length() == 2){			
			String sDigit = Character.toString(firstString.charAt(1));			
			while(firstN < secondN){
				firstString = String.valueOf(firstN);				
				fDigit = Character.toString(firstString.charAt(0));
				sDigit = Character.toString(firstString.charAt(1));
				int swapN = Integer.parseInt(sDigit + fDigit);				
				if(swapN > firstN && swapN <= secondN){
					count++;
				}
				firstN++;
			}			
		}
		
		if(firstString.length() == 3){
			String sDigit = Character.toString(firstString.charAt(1));
			String tDigit = Character.toString(firstString.charAt(2));
			while(firstN < secondN){
				firstString = String.valueOf(firstN);
				fDigit = Character.toString(firstString.charAt(0));
				sDigit = Character.toString(firstString.charAt(1));
				tDigit = Character.toString(firstString.charAt(2));
				
				int swapl = Integer.parseInt(tDigit + fDigit + sDigit);
				if(swapl > firstN && swapl <= secondN)
					count++;
				
				int swapBoth = Integer.parseInt(sDigit + tDigit + fDigit);
				if(swapBoth > firstN && swapBoth <= secondN)
					count++;
				
				firstN++;
			}	
			
		}		
		return count;		
	}
	
	
	public void initInFile(String name){		
		try{		
		 br = new BufferedReader(new FileReader(name));		
		}catch(FileNotFoundException fnfe){
			fnfe.printStackTrace();
		}		
	}
	
	public void initOutFile(String name){		
		try{		
		 pw = new PrintWriter(new FileWriter(name));		
		}catch(IOException ex){
			ex.printStackTrace();
		}		
	}
}
