/*
 * 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 cs224n.gcj;

import java.io.IOException;
import java.util.HashSet;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.FileInputStream;
import java.io.PrintWriter;
import java.io.FileWriter;
import java.io.File;



public class ProbC {

	static int getNRecycledPair(int b, int B){
		
		String s = new Integer(b).toString();		
		int nDigits = s.length();
		
		String ls, rs;
		HashSet<Integer> validPairs = new HashSet<Integer>();
		
		for(int i = 1; i < nDigits; i++){
			ls = s.substring(0, i);
			rs = s.substring(i);
			int rotb = Integer.parseInt((rs+ls));
			if(rotb > b && rotb <= B)
				validPairs.add(rotb);				
		}
		return validPairs.size();
		
	}
	
	static public int getTotRecycledPair(int A, int B){
		
		int n = 0;
		for(int i = A; i <= B; i++){
			n += getNRecycledPair(i, B);
		}
		
		return n;
	}
	
	static public void main(String[] args) throws IOException{
		
		File inFile = new File(args[0]);
		File outFile = new File(args[1]);
		
		if(!inFile.exists())
			System.out.println("File Does Not Exist!");

		
		BufferedReader in = new BufferedReader( new InputStreamReader( new FileInputStream(inFile) ) );
		PrintWriter out = new PrintWriter( new FileWriter(args[1]), true );
		
		String line;
		line = in.readLine();
		int T = Integer.parseInt(line);
		for(int i = 1; i <= T; i++){
			
			line = in.readLine();
			String[] parts = line.split(" ");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			out.print("Case #"+i+": ");
			out.println( getTotRecycledPair(A,B) );
			
		}
		
		
		in.close();
		out.close();
		
		
	}
	
}
