import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Recycled {
	public static void main(String[] args) throws Exception{
		String inputFile = "C-small-attempt0.in";
		
		BufferedReader input = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
		BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output")));
		long num_cases = Long.parseLong(input.readLine());
		int current_case = 0;
		
		while (current_case < num_cases){
			current_case++;
			
			String[] fields = input.readLine().split(" ");
			int A = Integer.parseInt(fields[0]);
			int B = Integer.parseInt(fields[1]);
			int total = 0;
			
			for (int n = A; n < B; n++){
				for (int m = n+1; m <= B; m++){
					if (isRecycled(n,m)) total++;
				}
			}
			
			System.out.println("Case #" + current_case + ": " + total);
			output.write("Case #" + current_case + ": " + total + "\n");
		}
		output.close();
	}

	private static boolean isRecycled(int n, int m) {
		String sn = ""+n;
		String sm = ""+m;
		if (sn.length() != sm.length()) return false;
		int totaln = 0, totalm = 0;
		for (int i = 0; i < sn.length(); i++){
			totaln += sn.charAt(i);
			totalm += sm.charAt(i);
		}
		if (totaln != totalm) return false;
		for (int i = 0; i < sn.length()-1; i++){
			sm = sm.charAt(sm.length() - 1) + sm.substring(0, sm.length() - 1);
			if (sm.equals(sn)) return true;
		}
		return false;
	}
}

package google.codejam2012.qualification;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class RecycledNumbers {
	
	static private int getDigitsCount(int number) {
		int sh = 10;
		int digits = 1;
		while (sh <= number) {
			sh *= 10;
			digits++;
		}
		return digits;
	}
	
	static private int getRecyclingPairsCount(int number, int limit) {
		int digits = getDigitsCount(number);
		int sh = 1;
		for (int i = 1; i < digits; i++) {
			sh *= 10;
		}
		int permutation = number;
		int result = 0;
		int[] usedNumbers = new int[digits];
		int usedNumbersCount = 0;
		for (int i = 1; i < digits; i++) {
			permutation = (permutation % 10) * sh + (permutation / 10);
			if (number < permutation & permutation <= limit) {
				boolean isNumberAlreadyUsed = false;
				for (int j = 0; j < usedNumbersCount; j++) {
					if (usedNumbers[j] == permutation) {
						isNumberAlreadyUsed = true;
						break;
					}
				}
				if (!isNumberAlreadyUsed) {
					usedNumbers[usedNumbersCount++] = permutation;
					result++;
				}
			}
		}
		return result;
	}
	
	static public void main(String[] args) {
		try {
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in), 64 << 10);
			int testsNumber = Integer.parseInt(br.readLine().trim());
			for (int test = 1; test <= testsNumber; test++) {
				StringTokenizer tokenizer = new StringTokenizer(br.readLine());
				int startingNumber = Integer.parseInt(tokenizer.nextToken());
				int endingNumber = Integer.parseInt(tokenizer.nextToken());
				int result = 0;
				for (int number = startingNumber; number <= endingNumber; number++) {
					result += getRecyclingPairsCount(number, endingNumber);
				}
				System.out.println("Case #" + test + ": " + result);
			}
		}
		catch (Exception e) {
			System.err.println("Error:" + e.getMessage());
		}
	}
}
