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

public class Test_C {
        
    public static void main(String[] args) {
    	try{      
        FileReader fr = new FileReader("D:/codejam/C-small-attempt0.in");
        BufferedReader br = new BufferedReader(fr);
        FileWriter fw = new FileWriter("D:/codejam/C-small-attempt0-out.txt");
        BufferedWriter bw = new BufferedWriter(fw);
        
        long c,a,b;
        int n;
        String line;
        String t[];
        long g[];
        long ans = 0;
        c = Integer.parseInt(br.readLine());
        //c = 1;
        String x,p,m,s,m1="";
                        
        for(int i=1;i<=c;i++) {
        	line = br.readLine();
        	ans = 0;
        	//line = "1111 2222";
        	t = line.split(" ");
        	n = t[0].length();
        	a = Long.parseLong(t[0]);
        	b = Long.parseLong(t[1]);
        	String temp[];
        	boolean oops = false;
        	for(long j=a;j<b;j++) {
        		s = j + "";
        		oops = false;
        		temp = new String[n-1];
        		for(int k=1;k<n;k++) {
        			x="";m="";       
        			//s=j+"";
        			if(s.charAt(k) >= line.charAt(0)){
        				
        			x = s.substring(k);        			
        			m = x + s.substring(0,k);    
        			temp[k-1] = m;
        			for(int y=0;y<k-1;y++)
        				if(m.equals(temp[y]))
        					oops = true;
        					 			
        			if(Long.parseLong(m)<=b && Long.parseLong(m)>j && Long.parseLong(m)>=a && oops == false) {
        				System.out.println(s + "     "+m);
        				ans++;
        			}
        			}       			       					 
        		}
        	}
        	
        	System.out.println("ans = "+ans);
        	String res = "Case #"+i+": "+ans;
        	bw.write(res,0,res.length());
        	bw.flush();
        	bw.newLine();
        }
        }
    	catch(Exception e){}
    }
}
