/*
 * 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.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;


public class g {
	
	public static int go(String a, String b) {

		if (Integer.parseInt(a) > Integer.parseInt(b)) {
			return 0;
		}
		if (a.toCharArray().length == 1 || b.toCharArray().length == 1) {
			return 0;
		}
		
		HashSet<Object> hs = new HashSet<Object>();
//		ArrayList<GGG> al = new ArrayList<Object>();
//		HashMap<GGG, Integer> hm = new HashMap<Object, Integer>();
		
		int counter = 0;
		char[] ch_n;
		int d = 0, reminder = 0;
		int n = Integer.parseInt(a);
		int val = 0;
		int[] input;
		for (int i = Integer.parseInt(a) ; i < Integer.parseInt(b) ; i++) {
			n += 1;
			Integer in = new Integer(n);
			ch_n = in.toString().toCharArray();
//			System.out.println(n);
			val = n;
			for (int j = 0 ; j < ch_n.length - 1 ; j++) {
				d = (int) (val / Math.pow(10, ch_n.length - 1));
				reminder = (int) (val % Math.pow(10, ch_n.length - 1));
				val = reminder * 10 + d;
//				System.out.println(val);
				if (val < n) {
					if (val >= Integer.parseInt(a) && n <= Integer.parseInt(b)) {
//						System.out.println(val);
//						System.out.println(n);
//						System.out.println("------");
						input = new int[]{val, n};
//						System.out.println(Arrays.toString(input));
						HSC g = new HSC(val, n);
						hs.add(g);
						
					}
				} else if (val > n) {
					if (n >= Integer.parseInt(a) && val <= Integer.parseInt(b)) {
//						System.out.println(n);
//						System.out.println(val);
//						System.out.println("******");
//						counter++;
						
						input = new int[]{n, val};
//						System.out.println(Arrays.toString(input));
						HSC g = new HSC(n, val);
						hs.add(g);
					}
				}
			}
		}
		return hs.size();
//		System.out.println(hs.size());
	}

	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		try {
			BufferedReader f = new BufferedReader(new FileReader("C-small-attempt3.in"));
			PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("test.out")));
			String str;
			int T = 0;
			int c = 0;
			int answer = 0;
			String A = "", B = "";
			ArrayList<String> lines = new ArrayList<String>();
			
			while((str = f.readLine()) != null) {
				if (c == 0) {
					T = Integer.parseInt(str);
				} else {
					A = str.split(" ")[0];
					B = str.split(" ")[1];
					answer = go(A, B);
//					System.out.println(answer);
					out.print("Case #" + (new Integer(c)).toString() + ": " + (new Integer(answer)).toString());
					if (c != T) {
						out.println();
					}
				}
				c++;
			}
//			System.out.println(T);
//			
//			
//			int cc = 1;
//			for (String s : lines) {
//				A = s.split(" ")[0];
//				B = s.split(" ")[1];
//
//				answer = go(A, B);
//				
//				if (cc != T) {
//					out.println();
//				}
//				cc++;
//			}
			
			out.close();
			System.exit(0);  
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}

}
