/*
 * 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.*;
//import java.util.*;
import java.util.Arrays;
import java.util.StringTokenizer;

class recyclednums {
  public static void main (String [] args) throws IOException {
	  
    BufferedReader f = new BufferedReader(new FileReader("recyclednums.in"));
    
    PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("recyclednums.out")));
    
    int n = Integer.parseInt(f.readLine());

    int[][] testcase = new int[n][2];
    int[] answer = new int[n];
    
    for(int i=0; i<n; i++){
        StringTokenizer st = new StringTokenizer(f.readLine());
    
        testcase[i][0] = Integer.parseInt(st.nextToken());
        testcase[i][1] = Integer.parseInt(st.nextToken());
        answer[i] = 0;
    }
    
    //System.out.println(qualify(Integer.toString(12345).toCharArray(),Integer.toString(34512).toCharArray()));
    
    for(int i=0; i<n; i++){
    	
    	//System.out.println("test case " + n);
    	
    	for(int j=testcase[i][0]; j<testcase[i][1]; j++){ //double check these indices
    		
    		for(int k=j+1; k<testcase[i][1]+1; k++){
    			
  			  String s1 = Integer.toString(j);
			  String s2 = Integer.toString(k);
			  
			  //System.out.println("testing " + j + " and " + k);
    			
    			if(!qualify(s1.toCharArray(),s2.toCharArray()))
    				continue;
    		
    			for(int si=1; si<s1.length(); si++){ //split the string in two then try to "recycle" the pieces
    				
    				String rec1 = s1.substring(0,si);
    				String rec2 = s1.substring(si);
    				
    				if ((rec2 + rec1).equals(s2)){
    					//System.out.println("Success!, " + rec2 + rec1 + " equals " + s2);
    					answer[i]++;
    					break;
    				}
    				
    				//System.out.println(rec1);
    				//System.out.println(rec2);
    				
    			}

    			
    			
    		}
    		
    	}
    	
    }

    for(int i=0; i<n; i++){
    	out.println("Case #" + (i+1) + ": " + answer[i]);
    }
    
    out.close();                                  
    
    System.exit(0);                             
  }
  
  public static boolean qualify(char[] a, char[] b){ //return false if these two numbers cannot POSSIBLY be recycled
	  
	  char[] arr1 = a;
	  char[] arr2 = b;
	  
	  int digit1 = arr1.length;
	  int digit2 = arr2.length;
	  
	  if (digit1 != digit2) //same num of digits
		  return false;
	  
	  Arrays.sort(arr1);
	  Arrays.sort(arr2);
	  
	  if (!Arrays.equals(arr1,arr2)){ //same usage of digits
		  return false;
	  }
	  
	  return true;
	  
  }
  
}
