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

// Recycled Numbers

import java.io.*;
import java.util.*;

public class RecycledNumbers {
	public static void main(String[] args) throws Exception {
		String inputPath = args[args.length-2];
		String outputPath = args[args.length-1];
		
		BufferedReader br = new BufferedReader(new FileReader(inputPath));
		int numberOfTestCases = Integer.parseInt(br.readLine());
		
		StringBuilder output = new StringBuilder();
		
		for (int i=1; i<=numberOfTestCases; i++) {
			String[] components = br.readLine().split(" ");
			int minValue = Integer.parseInt(components[0]);
			int maxValue = Integer.parseInt(components[1]);
			
			int numberOfPairs = 0;
			
			ArrayList<String> list = new ArrayList<String>();
			
			for (int value=minValue; value<=maxValue; value++) {
				String vString = Integer.toString(value);
				if (list.indexOf(vString) == -1) {
					boolean mainItemAdded = false;
					int numberOfSubpairs = 0;
					int vStringLength = vString.length();
					for (int vStringIndex=1; vStringIndex<vString.length(); vStringIndex++) {
						StringBuilder sb = new StringBuilder(vString);
						String part = sb.substring(0, vStringIndex);
						sb.delete(0, vStringIndex);
						sb.append(part);
						
						String newValueString = sb.toString();
						int newValue = Integer.parseInt(newValueString);
						int newValueLength = Integer.toString(newValue).length();
						if ((vStringLength==newValueLength) && (vString.equals(newValueString) == false) && (list.indexOf(newValueString) == -1) && (newValue >= minValue) && (newValue <= maxValue)) {
							if (mainItemAdded == false) {
								mainItemAdded = true;
								list.add(vString);
//								System.out.println(vString);
								numberOfSubpairs++;
							}
							numberOfSubpairs++;
							list.add(newValueString);
//							System.out.println(newValueString);
						}
					}
					for (int s=numberOfSubpairs-1; s>0; s--) {
						numberOfPairs+=s;
					}
//					System.out.println("Pair: " + numberOfPairs + " Sub: " + numberOfSubpairs);
				}
			}
			System.out.println("Case #" + i + ": " + numberOfPairs + "\n");
			output.append("Case #" + i + ": " + numberOfPairs + "\n");
		}
		
		BufferedWriter bw = new BufferedWriter(new FileWriter(outputPath));
		String outputString = output.toString();
		bw.write(outputString, 0, outputString.length());
		bw.close();
	}
}