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.*;
import java.io.InputStreamReader;
import java.util.*;


public class b {
	static TreeSet<int[]> set;
	static boolean[][] matriz;
	static int cantidad;
	public static void main(String[] args) throws Throwable {
		BufferedReader bf = new BufferedReader(new FileReader("b.txt"));
		System.setOut(new PrintStream("b.out"));
		int casos = Integer.parseInt(bf.readLine());
		for (int i = 0; i < casos; i++) {
			StringTokenizer st = new StringTokenizer(bf.readLine());
			matriz = new boolean[1001][1001];
			cantidad = 0;
			set=new TreeSet<int[]>(new Comparator<int[]>(){
				public int compare(int[] arg0, int[] arg1) {
					return 0;
				}
				
			});
			int a = Integer.parseInt(st.nextToken());
			int b = Integer.parseInt(st.nextToken());
			int min = Math.min(a, b); int max = Math.max(a, b);
			for (int j = min; j <= max; j++) {
				calcular(j, min, max);
			}
			System.out.println("Case #"+(i+1)+": "+cantidad);
		}
		
	}

	private static void calcular(int a , int min , int max) {
		String n = a+"";
		for (int i = 1; i < n.length(); i++) {
			String copia = n.substring(i)+n.substring(0,i);
			int c = Integer.parseInt(copia);
			String c2 = c+"";
			if(c!=a&&  c2.length()==n.length() &&  min <= c  && c <= max ){
				if( !matriz[a][c] ){
					matriz[a][c] = true;
					matriz[c][a] = true;
					cantidad++;
				}
			}
		}
	}

}
