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.util.Scanner;
public class Rec {
static Scanner sc =new Scanner(System.in);
public  static void main (String [] args ) {
int n =sc.nextInt();

for (int m =1; m <= n; m++) handleCase(m);
}
public static int a,b;
static void handleCase(int num) {
int sum=0;
 a =sc.nextInt();
 b =sc.nextInt();
for (int i =a; i <=b;i++) {
for (int j =a; j <i;j++) {
if (i==j) continue;
sum +=perm(i, j);
}
}
System.out.println("Case #" +num +": "+sum);
}

static int perm(int j, int k) {
String s =new Integer(j).toString();
//boolean [][] f=new boolean[b-a][b-a];
String t =new Integer(k).toString();
int sum =0;
for (int div =1;div < s.length();div++) {
String r =s.substring(div) +s.substring(0,div);
if (r.equals(t)) {
//if (f [j-a][k-a]) System.out.println(s +"&"+t);
//System.out.println(t+"=" +s+"p"+div);
//f [j-a][k-a] =true;
//f [k-a][j-a] =true;
sum++;
break;
}
}
return sum;
}

}
