
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}
package com.lily.acm.googleCodeJam;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashSet;

public class RecycledNumbers
{
    public static int getRecyleCount(int n,int start,int end){
        int temp2=n;
        int count =0;
        int digit=0;
        int max=1;
        int temp =n;
        while(temp!=0){
            digit++;
            temp/=10;
            max*=10;
        }
        max/=10;
        
        HashSet<Integer> set =new HashSet<Integer>();
        for(int i=1;i<digit;i++){
            temp =n%10;
            n/=10;
            n+=temp*max;
            set.add(n);
        }
        for(int i:set){
            if(i>=start&&i<=end&&i>max&&i!=temp2) {
                count++;
            }
        }

        return count;
    }
    
    public static void readInput(String fileName){
        BufferedReader is= null;
        FileOutputStream os =null;
        int count=1;
        try
        {
             is  =  new BufferedReader(new FileReader(fileName));
             os = new FileOutputStream(new File("c://output.txt"));
             String input="";
            
             if(is.readLine()==null) return ;
             while((input= is.readLine())!=null){
                 os.write(("Case #"+count+++": "+lineCount(input.split(" ")[0],input.split(" ")[1])+"\r\n").getBytes());
                 os.flush();
            }
            
        }
        catch (FileNotFoundException e)
        {
            e.printStackTrace();
        }
        catch (IOException e)
        {
            e.printStackTrace();
        }finally{
            try
            {
                is.close();
                os.close();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
        }
    }

    public static int lineCount(String start,String end)
    {
        int s=Integer.valueOf(start);
        int e=Integer.valueOf(end);
        int total=0;
        for(int i=s;i<=e;i++){
            total+=getRecyleCount(i,s,e);
        }
       return total/2;
    }
    public static void main(String[] args)
    {
        readInput("c://C-small-attempt0.in");
    }
}
