/*
 * 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();

    }

}

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

package googlecodejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.Writer;

/**
 *
 * @author rerngrak
 */
public class RecycledNumber {
    public static void main(String[] args) throws Exception {
        File input = new File("src/googlecodejam/C-small-attempt0.in");
        BufferedReader reader = new BufferedReader(new InputStreamReader(new FileInputStream(input)));

        //first line for number of line
        long row = Long.valueOf(reader.readLine());

        File file = new File("output.txt");
        Writer writer = new BufferedWriter(new FileWriter(file));

        

        for (long l=1;l<=row;l++){
            String line = reader.readLine();

            String in[] = line.split(" ");
            
            long m = Long.valueOf(in[0]);
            long n = Long.valueOf(in[1]);
            
            int counter = 0;
            for (long i=m;i<=n;i++){
                char[] ab = String.valueOf(i).toCharArray();
                if (ab.length == 1){
                    continue;
                }else if (ab.length == 2){
                    String x = new String(""+ab[0]);
                    String y = new String(""+ab[1]);
                    if (!x.equals(y) && !y.equals("0")){
                        
                        long swap = new Long(y+x).longValue();
                        if (swap > i && swap <= n) {
                            counter++;
                            continue;
                        }
                    }
                    
                }else if (ab.length == 3){
                    String x = new String(""+ab[0]);
                    String y = new String(""+ab[1]);
                    String xy = x.concat(y);
                    String z = new String(""+ab[2]);
                    String yz = y.concat(z);

                    if (!xy.equals(yz) && !yz.equals("00")){
                        
                        long swap2 = new Long(z.concat(xy)).longValue();
                        if (swap2 > i && swap2 <= n){
                            counter++;
                            
                        }
                        long swap1 = new Long(yz.concat(x)).longValue();
                        if (swap1 > i && swap1 <= n){
                            counter++;
                            
                        }
                        continue;
                    } 
                }else if (ab.length == 4){
                    String a = new String(""+ab[0]);
                    String b = new String(""+ab[1]);
                    String c = new String(""+ab[2]);
                    String d = new String(""+ab[3]);
                    counter = 287;

                }
            }

            System.out.println("Case #"+l+": "+counter);
            String writeout = "Case #"+l+": "+counter +"\n";
            writer.write(writeout);
            
        }
        reader.close();
        writer.close();
       
    }
    

}
