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 egWo;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Cs {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();

		for (int l = 1; l <= T; l++) {
			in.nextLine();
			int n = in.nextInt();
			int m = in.nextInt();
			int count = 0;

			if ((n % 10 > 0 && n / 10 == 0)) {
				count = 0;
			} else {
				for (int i = n; i < m; i++) {
					if (i / 10 < 10) {
						int u = i % 10;
						int ten = i / 10;
						int revI = (u * 10) + ten;
						if (i < revI && revI < m) {
							count++;
						}
					} else if (i / 10 <= 100 && i / 10 >= 10) {
						int uni = (i % 100) % 10;
						int ten = (i / 10) % 10;
						int per = i / 100;
						ArrayList revI = new ArrayList();
						revI.add(ten * 100 + uni * 10 + per);
						revI.add(uni * 100 + per * 10 + ten);

						Set set = new HashSet(revI);
						for (Object j : set) {							
							if (i < ((Integer) j).intValue()
									&& ((Integer) j).intValue() <= m) {
								count++;
							}
						}
					}
				}
			}
			System.out.format("\nCase #%d: %d", l, count);
		}
	}
}
