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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.StringTokenizer;

public class Main {

	public static int keta;
	public static void main(String[] args) throws Exception {

		FileReader in = new FileReader("F:\\download\\C-small-attempt0.in");
		BufferedReader br = new BufferedReader(in);
		FileWriter out = new FileWriter("F:\\download\\out.txt");
		BufferedWriter bw = new BufferedWriter(out);

		int t = Integer.parseInt(br.readLine());
		for (int c = 0; c < t; c++){
			String line = br.readLine();
			StringTokenizer aSt = new StringTokenizer(line, " ");
			int a = Integer.valueOf(aSt.nextToken()).intValue();
			int b = Integer.valueOf(aSt.nextToken()).intValue();

			keta = (int)Math.log10(a) + 1;
			int pairs = 0;
			for (int n = a; n <= b; n++){
				pairs += pairs(a, b, n);
			}

			bw.write(String.format("Case #%d: %d\n", c+1, pairs));
		}
		
		br.close();
		in.close();
		bw.close();
		out.close();

	}

	public static int pairs(int a, int b, int num){
		int numbers = 1;
		int[] stock = new int[keta];
		stock[0] = num;
		
		for (int x = 1; x < keta; x++){
			int recycle = (num % (int)Math.pow(10, keta - x)) * (int)Math.pow(10, x) + (int)(num / (int)Math.pow(10, keta - x));
			if ((a <= recycle)&&(recycle <= b)){
				if (recycle < num) return 0;
				boolean flag = false;
				for (int st = 0; st < numbers; st++){
					if (stock[st] == recycle) flag = true;
				}
				if (!flag){
					stock[numbers] = recycle;
					numbers ++;
				}
			}
		}

		return numbers * (numbers - 1) / 2;
	}
}
