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.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;

/**
 * 
 * Google Code Jam 2012 Qualification Round - Problem C. Recycled Numbers
 * 
 * @author matlock
 *
 */
public class RecycledNumbers {

	public static void main(String[] args) {
		RecycledNumbers g = new RecycledNumbers();
		g.goGo();
	}

	public void goGo() {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		
		try {
			int testCases = Integer.parseInt(in.readLine());
			
			for (int i = 1; i <= testCases; i++) {
				String inputText = in.readLine();
				String[] numberPair = inputText.split(" ", 2);
				
				int matches = runTestCase(Integer.valueOf(numberPair[0]), Integer.valueOf(numberPair[1]));
				
				System.out.println("Case #" + i + ": " + matches);
			}
		} catch (IOException e) {
			System.out.println("Exception: " + e.getMessage());
		}
	}

	public int runTestCase(int startVal, int endVal) {
		Set<String> sourceSet = new HashSet<String>();
		Set<String> discoveredSet = new HashSet<String>();
		int totalMatches = 0;
		// first store all the source numbers
		for (int j = startVal; j <= endVal; j++) {
			sourceSet.add(String.valueOf(j));
		}

		for (int j = startVal; j <= endVal; j++) {
			StringBuffer buf = new StringBuffer(String.valueOf(j));
			int len = buf.length() - 1; // don't need last rotation, so -1
			// rotate the characters
			for (int k = 0; k < len; k++) {
				buf.append(buf.charAt(0));
				buf.deleteCharAt(0);
				
				if (Integer.valueOf(buf.toString()) != j) {
					if (sourceSet.contains(buf.toString()) &&
							!discoveredSet.contains(String.valueOf(j) + buf.toString())) {
						discoveredSet.add(String.valueOf(j) + buf.toString());
						discoveredSet.add(buf.toString() + String.valueOf(j));
						totalMatches++;
						sourceSet.remove(String.valueOf(j)); // remove from set
					}
				}
			}			
		}

		return totalMatches;
	}

}
