/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package year_2012.qualification;

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

/**
 *
 * @author paul
 * @date 14 Apr 2012
 */
public class QuestionC {

    private static Set<Integer> getCycle(int x) {

        String s = Integer.toString(x);
        Set<Integer> set = new HashSet<Integer>();
        set.add(x);
        for (int c = 1; c < s.length(); c++) {
            String t = s.substring(c).concat(s.substring(0, c));
            set.add(Integer.parseInt(t));
        }
        return set;
        
    }

    private static Set<Integer> mask(Set<Integer> set, int a, int b) {
        Set<Integer> result = new HashSet<Integer>();

        for (int x : set) {
            if (x >= a && x <= b) {
                result.add(x);
            }
        }
        
        return result;

    }


    public static void main(String[] args) throws FileNotFoundException, IOException {

        String question = "C";

//        String name = "large";
        String name = "small-attempt0";
//        String name = "test";

        String filename = String.format("%s-%s", question, name);

        BufferedReader input = new BufferedReader(
                new FileReader(String.format("/home/paul/Documents/code-jam/2012/qualification/%s.in",
                filename)));

        String firstLine = input.readLine();

        PrintWriter pw = new PrintWriter(new File(
                String.format("/home/paul/Documents/code-jam/2012/qualification/%s.out", filename)));


        int T = Integer.parseInt(firstLine);

        // Loop through test cases.
        for (int i = 0; i < T; i++) {

//             Read data.
            String[] tokens = input.readLine().split(" ");

//            int N = Integer.parseInt(input.readLine());

            int A = Integer.parseInt(tokens[0]);
            int B = Integer.parseInt(tokens[1]);

//            System.out.format("%d, %d\n", A, B);

            boolean[] used = new boolean[B+1];
            int total = 0;
            for (int n = A; n <= B; n++) {
                if (!used[n]) {
                    Set<Integer> set = mask(getCycle(n), A, B);
                    int k = set.size();
                    total += (k * (k-1))/2;
                    for (int m : set) {
                        used[m] = true;
                    }
                }
            }

            pw.format("Case #%d: %d\n", i + 1, total);
        }

        pw.close();

    }

}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.StringTokenizer;


public class Recycled { 
	
	HashMap<Integer, String> map; //key is the number, value is the sorted number in string form
	HashMap<Integer, Integer> digits; //key is the number, value is the sorted number in string form
	
 	public static void main(String[] arg) throws Exception {
 		Recycled pg = new Recycled();
	 
 		pg.init();
		 pg.go();
	}
 	
 	Recycled()
	{
 	 map = new HashMap<Integer, String>();
 	 digits = new HashMap<Integer, Integer>();
	}
 	
 	private void init()
 	{
 		int arr[] = {0,0,0,0,0,0,0,0,0,0};
 		int rem;
 		StringBuilder str = new StringBuilder();
 		int i; 
 		int digits;
 		for(int no = 1 ; no <= 2000000; no++)
 	     {
 			i = no;
 			digits  = 0;
 			while(i > 0)
 			{
 				rem = i % 10;
 				arr[rem]++;
 				i = i / 10; 
 				digits++;
 			}
 			
 			str.delete(0, str.length());
 			for(int j = 0; j < arr.length; j++)
 			{
 				while(arr[j] > 0)
 				{
 					str.append(j);
 					arr[j]--;
 				}
 			}
 			
 			map.put(no, str.toString());
 			this.digits.put(no, digits);
 	    	//reset the array
 	     }
 		//System.out.println("Done initialization");
 	}
 	
  	public void go()
	{
 		String line = "";
			try {
			    BufferedReader in = new BufferedReader(new FileReader("C-small-attempt0.in"));
			     
			    StringBuilder outString = new StringBuilder();
			    StringTokenizer tokens;
			    
	             
	            int caseNo = 0;
	             
	            int T = Integer.parseInt(in.readLine().trim());
	            int A,B, high;
	            String s1, s2;
	            int count;
	            while(caseNo++ < T)
	            {
 	              line = in.readLine().trim();
 	              tokens = new StringTokenizer(line);
 	              A = Integer.parseInt(tokens.nextToken().trim());
 	              B = Integer.parseInt(tokens.nextToken().trim());
 	              
 	             count = 0;
 	              for(int n = A; n < B; n++)
 	              {
 	            	  high = (int)Math.pow(10,digits.get(n)) - 1;
 	            	  high = Math.min(high, B);
 	            	  for(int m = n + 1; m <= high; m++)
 	            	  {
 	            		  s1 = map.get(n);
 	            		  s2 = map.get(m);
 	            		  if(!s1.equals(s2))
 	            			  continue;
 	            		  
 	            		  if((n + "" + n).indexOf(m+"") != -1)
 	            		  {
 	            			  count++;
// 	            			  System.out.println(" Pairs (" +n + " " +m + ")"); 	            			  
 	            		  }
 	            		  
 	            	  }
 	              }
            	  
 	             outString.append("Case #" + caseNo + ": " +count ); 	               
	             
	              outString.append("\n");
	            }
	  		    BufferedWriter pwr = new BufferedWriter(new FileWriter("output.txt"));
			    pwr.write(outString.toString());
			    pwr.close();		    
			    in.close();
			}
			catch (Exception e) 
			{
				e.printStackTrace();
				System.out.println("processing : " + line);
			}
	}
}
