/*
 * 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.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;


public class Main {
	public static void main(String[] args) {
		File inputFile = new File("input.txt");
		BufferedReader br = null;
		FileOutputStream out = null;
		try {
			br = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
			String line;
			line = br.readLine();
			if (line == null) {
				throw new IllegalStateException("Empty input file!!!");
			}
			
			
			StringBuilder result = new StringBuilder();
			
			int length = Integer.parseInt(line), i = 1;
			while (i <= length) {
				result.append("Case #").append(i).append(": ");
///////////////////////////////////////////////////////////////////////////////////////////////////

				Set<String> match = new HashSet<String>();
				String[] numbers = br.readLine().split(" ");
				int n = Integer.parseInt(numbers[0]);
				int m = Integer.parseInt(numbers[1]);
				for (int j = n;j < m; j++) {
					String num = j + "";
					char[] charArray = num.toCharArray();
					if (num.length() < 2 || isCharsEqual(charArray)) {
						continue;
					}
					
					addMatches(charArray, n, m, match);
				}
				result.append(match.size());
				
///////////////////////////////////////////////////////////////////////////////////////////////////
				result.append("\n");
				i++;
			}
			
			File outputFile = new File("output.txt");
			outputFile.delete();
			outputFile.createNewFile();
			
			out = new FileOutputStream(outputFile);
			out.write(result.toString().getBytes());
	} catch (IOException e) {
			e.printStackTrace();
		} finally {
			if (br != null) {
				try {
					br.close();
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			
			if (out != null) {
				try {
					out.close();
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
		}
	}
	
	private static boolean isCharsEqual(char[] num) {
		char c = num[0];
		for (int i = 1; i < num.length; i++) {
			if (c != num[i]) {
				return false;
			}
		}
		
		return true;
	}
	
	private static void addMatches(char[] num, int lower, int upper, Set<String> match) {
		String n = new String(num);
		char[] tmp = spin(num);
		
		for (int i = 1; i < num.length; i++) {
			if (tmp[0] != '0') {
				int m = Integer.parseInt(new String(tmp));
				String key = genKey(n, "" + m);
				if (lower <= m && m <= upper && !n.equals(m + "") && !match.contains(key)) {
					match.add(key);
				}
			}
			tmp = spin(tmp);
		}
	}
	
	private static char[] spin(char[] source) {
		char[] target = new char[source.length];
		for (int i = 1; i < source.length; i++) {
			target[i] = source[i - 1];
		}
		target[0] = source[source.length - 1];
		return target;
	}
	
	private static String genKey(String n, String m) {
		if (n.compareTo(m) < 0) {
			return n + "|" + m;
		} else 
			return m + "|" + n;
	}
}
