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

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.Vector;


public class Recycled {
	public static void main(String[] args) throws FileNotFoundException {

		Scanner in = new Scanner(new FileReader(new File("C-small-attempt0.in")));
		
		PrintWriter out = new PrintWriter(new File("C-small-attempt0.out"));
		
		int t = in.nextInt();
		in.nextLine();
		
		for(int i=0; i<t; i++) {
			int a = in.nextInt();
			int b = in.nextInt();
			int l = Integer.toString(a).length();
			int r = 0;
			

//			System.out.println("a="+a+"\tb="+b);
			
			Vector<Integer> sub = new Vector<Integer>(20); 
			
			for(int c=a; c<=b; c++) {
				String cs = Integer.toString(c);
				
				sub.removeAllElements();

				for(int k=1; k<l;k++) {
					cs = cs.substring(1) + cs.charAt(0);
					if (cs.charAt(0) == '0') continue;

					int ns = Integer.parseInt(cs);
					if (ns > c && ns <= b && !sub.contains(ns)) {
						sub.add(ns);
						r++;
//						System.out.println(c+" -> "+ns);
					}
				}
//				System.out.println("......");
			}
			
			System.out.println("Case #" + (i+1)+ " of "+t+": " + r);
//			System.out.println("==================");
			
			out.println("Case #" + (i+1)+ ": " + r);
		}
		out.close();
	}
}
