/*
 * 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.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;



public class RecycledNumbers {

	public static void main(String[] args) throws IOException {
		if(args.length != 2) {
			System.out.println("Error");
			System.exit(1);
		}
		
		RecycledNumbers recycle = new RecycledNumbers();
		
		BufferedReader in = new BufferedReader(new FileReader(new File(args[0])));
		PrintWriter out = new PrintWriter(new File(args[1]));
		
		in.readLine();
		int index = 1;
		while(true) {
			String line = in.readLine();
			if(line == null) break;
			String[] numbers = line.split(" ");
			out.println("Case #" + index + ": " + recycle.numOfRecycledNumbers(Integer.parseInt(numbers[0]), Integer.parseInt(numbers[1])));
			index++;
		}
		out.close();
		in.close();
	}
	
	private Map<Pair, Boolean> recycledNumbersMap = new HashMap<Pair, Boolean>(); 
	
	private class Pair {
		int n;
		int m;
		
		public Pair(int n, int m) {
			this.n = n;
			this.m = m;
		}

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + getOuterType().hashCode();
			result = prime * result + m;
			result = prime * result + n;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Pair other = (Pair) obj;
			if (!getOuterType().equals(other.getOuterType()))
				return false;
			if (m != other.m)
				return false;
			if (n != other.n)
				return false;
			return true;
		}

		private RecycledNumbers getOuterType() {
			return RecycledNumbers.this;
		}
	}
	
	public int numOfRecycledNumbers(int lowerLimit, int upperLimit) {
		int recycledNumbers = 0;
		for (int n = lowerLimit; n <= upperLimit; n++) {
			for (int m = n + 1; m <= upperLimit; m++) {
				Pair pair = new Pair(n, m);
				Pair otherPair = new Pair(m, n);
				if(recycledNumbersMap.containsKey(pair)) {
					if(recycledNumbersMap.get(pair)) recycledNumbers++;
					continue;
				}
				String nStr = String.valueOf(n);
				String mStr = String.valueOf(m);
				boolean foundRecycled;
				if (sameNumberOfDigits(nStr, mStr) && 
						containSameDigits(nStr, mStr) &&
						checkIfRecycledNumbers(nStr, mStr)) {
					recycledNumbers++;
					foundRecycled = true;
				} else {
					foundRecycled = false;
				}
				recycledNumbersMap.put(pair, foundRecycled);
				recycledNumbersMap.put(otherPair, foundRecycled);
			}
		}
		return recycledNumbers;
	}
	
	boolean sameNumberOfDigits(String n, String m) {
		return n.length() == m.length();
	}
	
	boolean containSameDigits(String n, String m) {
		while(!n.isEmpty()) {
			String c = n.charAt(0) + "";
			n = n.replaceFirst(c, "");
			if (!m.contains(c)) return false;
			m = m.replaceFirst(c, "");
		}
		return m.isEmpty();
	}
	
	boolean checkIfRecycledNumbers(String n, String m) {
		int secondLength = m.length();
		
		List<Integer> allIndexes = getAllIndexes(m, n.charAt(0));
		boolean foundRecycle;
		
		for(int index : allIndexes) {
			int secondIndex = index;
			foundRecycle = true;
			
			for(int firstIndex = 1; firstIndex < n.length(); firstIndex++) {
				secondIndex = (secondIndex + 1) % secondLength;
				if (n.charAt(firstIndex) != m.charAt(secondIndex)) {
					foundRecycle = false;
					break;
				}
			}
			if(foundRecycle) return true;
		}
		return false;
	}
	
	List<Integer> getAllIndexes(String str, char c) {
		List<Integer> indexes = new ArrayList<Integer>();
		int index = 0;
		while(true){
			if(index >= str.length()) break;
			index = str.indexOf(c, index);
			if(index == -1) break;
			indexes.add(index);
			index++;
		}
		return indexes;
	}
}
