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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

public class RecycledNumbers {

	public static void main(String... args) throws NumberFormatException, IOException {
		BufferedReader buffer = new BufferedReader(new InputStreamReader(new FileInputStream(args[0])));
		
		int qtd = Integer.parseInt(buffer.readLine());
		
		List<String> saida = new ArrayList<String>();
		for (int i = 1; i <= qtd; i++) {
			combinacoesFeitas = new HashSet<String>();
			saida.add("Case #" + i + ": " + qtsTemNoIntervalo(buffer.readLine()));
		}
		
		buffer.close();
		
		escrevaNoArquivoASaida("output.txt", saida);
	}

	private static void escrevaNoArquivoASaida(String nomeArquivo, List<String> saida) throws IOException {
		BufferedWriter br = new BufferedWriter(new FileWriter(new File(nomeArquivo)));  
		
		for (String string : saida) {
			br.write(string + "\n");
		}
		  
		br.close(); 
	}
	
	public static int qtsTemNoIntervalo(String linha) {
		String[] valores = linha.split(" ");
		return qtsTemNoIntervalo(Integer.valueOf(valores[0]), Integer.valueOf(valores[1]));
	}
	
	static Set<String> combinacoesFeitas = new HashSet<String>();
	public static int qtsTemNoIntervalo(int inicio, int fim) {
		int tamanhoString = String.valueOf(inicio).length();
		
		int count = 0;
		for (int numeroAtual = inicio; numeroAtual <= fim; numeroAtual++) {
			String numeroAtualString = String.valueOf(numeroAtual);
			
			for(int indiceSubs = 1; indiceSubs < tamanhoString; indiceSubs++) {
				String rabo = numeroAtualString.substring(indiceSubs);
				String cabeca = numeroAtualString.substring(0, indiceSubs);
				
				String novoNumeroString = rabo + cabeca;
				int novoNumero = Integer.valueOf(novoNumeroString);
				novoNumeroString = String.valueOf(novoNumero);
				
				if (inicio <= novoNumero 
					&& numeroAtual < novoNumero 
					&& novoNumero <= fim
					&& numeroAtualString.length() == novoNumeroString.length()
					&& !combinacoesFeitas.contains(numeroAtual + novoNumeroString)) {
					count++;
					combinacoesFeitas.add(numeroAtual + novoNumeroString);
				}
			}
		}

		return count;
	}

}
