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

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;

public class C {
	int digits(int in) {
		int count=0;
		for (;(in=in/10)>0; count++);
		return count;
	}
	int shift(int in, int mag) {	
		return  mag*(in%10) + in/10;
	}
	void run()throws IOException{
		BufferedReader bf = new BufferedReader(new FileReader("C.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("C.out"));
		
		int cases = Integer.parseInt(bf.readLine());
		for (int i=0; i<cases; i++) {
			String[] s = bf.readLine().split(" ");
			int from = Integer.parseInt(s[0]);
			int to = Integer.parseInt(s[1]);
			int count=0;
			for (int j=from; j<to; j++) {
				int in = j;
				int digits = digits(in);
				int mag = 1;
				for (int k = 0; k < digits; k++) {
					mag = mag*10;
				}
				HashSet<Integer> set = new HashSet<Integer>();
				for (int k = 0; k < digits; k++) {
					int shift = shift(in, mag);
					if (shift>j && shift <= to) {
						if (!set.contains(shift)) {
							set.add(shift);
							count++;
						}
					}
					in=shift;
				}
			}
			pw.write("Case #"+ (i+1) + ": "+ count + "\n");
		}
		pw.close();
	}
		
	public static void main(String[] args)throws IOException {
		new C().run();
	}
	
	
}
