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

public class Numbers{
	
	public static void main(String args[]){
		
		try{
			
			FileInputStream fstream = new FileInputStream(args[0]);
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			
			PrintWriter out = new PrintWriter(args[0] + "_out");
			
			String strLine = br.readLine();
			int cases = Integer.parseInt(strLine);
				
			for (int i = 0; i < cases; i++){
				//System.out.println("			i " + i);
				
				strLine = br.readLine();
				String[] a_and_b = strLine.split(" ");
				int a = Integer.parseInt(a_and_b[0]);
				int b = Integer.parseInt(a_and_b[1]);
				
				int length = String.valueOf(a).length();
				
				int[] found_as = new int[(int)java.lang.Math.pow(10,length+1)];
				
				int solutions = 0;
				
				for (double j = java.lang.Math.pow(10,length-1); j < java.lang.Math.pow(10,length); j++){
					//System.out.println("	j " + j);
					
					String this_number = String.valueOf(j);
					//System.out.println("this_number = " + this_number);
					char[] this_numbers_ciphers = this_number.toCharArray();
					//for (int k = 0; k < this_numbers_ciphers.length; k++) System.out.println("this_numbers_ciphers = " + this_numbers_ciphers[k]);
					
					for (int k = 0; k < length; k++){
						
						//System.out.println("		k " + k);
						
						char[] this_recycles_ciphers = new char[length];
						for (int l = 0; l < length; l++) {
							//System.out.println("				l " + l);
							//System.out.println("vor mod");
							int new_pos = (l + k) % length;
							//System.out.println("new pos = " + new_pos);
							//System.out.println("length = " + length);
							//System.out.println("this_numbers_ciphers[new_pos] = " + this_numbers_ciphers[new_pos]);
							//System.out.println("this_recycles_ciphers[l] = " + this_recycles_ciphers[l]);
							this_recycles_ciphers[l] = this_numbers_ciphers[new_pos];
							//System.out.println("nach mod" + l);
							}
						
						//System.out.println("-- vor new String");
						int m = Integer.parseInt(new String(this_recycles_ciphers));
						//System.out.println("-- nach new String");
						
						//System.out.println("--- vor if-Block");
						if ( a <= m && m < j && j <= b){
							boolean double_flag = false;
							//System.out.println("---- vor double_flag schleife");
							for (int l = 0; l < 2*solutions; l++) {
								//System.out.println("---- vor if-block in double_flag schleife");
								//System.out.println("found_as[2*l] = " + found_as[2*l]);
								//System.out.println("(int)j = " + (int)j);
								//System.out.println("found_as[2*l+1] = " + found_as[2*l+1]);
								//System.out.println("(int)m) = " + (int)m);
								if (found_as[2*l] == (int)j && found_as[2*l+1] == (int)m) {
									//System.out.println("----- vor anweisung");
									double_flag = true;
									//System.out.println("----- nach anweisung");
								}
								//System.out.println("---- nach if-block in double_flag schleife");
							}
							//System.out.println("---- nach double_flag schleife");
							found_as[2*solutions] = (int)j;
							found_as[2*solutions+1] = (int)m;
							if (double_flag != true) solutions++;
							double_flag = false;
							//System.out.println("case " + i + " solution " + solutions + " a " + a + " b " + b + " j " + j + " m " +  m);
						}
						//System.out.println("--- nach if-Block");
						
					}
					
				}
				
				out.println("Case #" + (i+1) + ": " + solutions);
				
			}
			
			in.close();
			out.close();
			
		}
		
		catch (Exception e){
			System.err.println("Error: " + e.getMessage());
		}
		
	}
		
}
	
