import java.util.*;
import java.io.*;

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
package google.code.jam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.ListIterator;

public class RecycledNumbers {

	final static String fileNameIn = "C-large.in";
	final static String fileNameOut = "C-large.out";

	private static int solve(int A, int B) {
		HashMap<String, Integer> hashMap = new HashMap<String, Integer>();
		for (int i = A; i <= B; i++) {
			String n = new Integer(i).toString();
			String key = minimum(n);
			if (Integer.valueOf(n) >= A && Integer.valueOf(n) <= B) {
				if (!hashMap.containsKey(key)) {
					hashMap.put(key, 1);
				} else {
					hashMap.put(key, hashMap.get(key) + 1);
				}
			}
		}
		int count = 0;
		for (String key : hashMap.keySet()) {
			Integer value = hashMap.get(key);
			count = count + (value * (value - 1) / 2);
		}
		return count;
	}

	private static String minimum(String input) {
		String min = input;
		for (int i = 0; i < input.length(); i++) {
			if (Integer.valueOf(shift(input, i)) < Integer.valueOf(min)) {
				min = shift(input, i);
			}
		}
		return min;
	}

	private static String shift(String input, int n) {
		return input.substring(n, input.length()) + input.substring(0, n);
	}

	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader(fileNameIn));
		BufferedWriter out = new BufferedWriter(new FileWriter(fileNameOut));
		int testCases = Integer.parseInt(in.readLine());
		for (int i = 0; i < testCases; i++) {
			String[] elements = in.readLine().split(
					new Character((char) 32).toString());
			List<Integer> values = new ArrayList<Integer>();
			for (String v : elements) {
				values.add(Integer.valueOf(v));
			}
			ListIterator<Integer> iterator = values.listIterator();
			int A = iterator.next();
			int B = iterator.next();
			out.write(String.format("Case #%s: %s\n", i + 1, solve(A, B)));
		}
		in.close();
		out.close();
	}

}
