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.HashMap;
import java.util.Map;


public class ProblemC {

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		int T = Integer.parseInt(reader.readLine());
		
		String[] split;
		StringBuilder number;
		int A, B, count, nAux;
		char first;
		//Map<Integer, Boolean> counted;
		Map<Integer, Boolean> countedAux;
		
		for(int t = 0; t < T; t++){
			//counted = new HashMap<Integer, Boolean>();
			count = 0;
			split = reader.readLine().split(" ");
			A = Integer.parseInt(split[0]);
			B = Integer.parseInt(split[1]);
			
			extern:for(int n = A; n < B; n++){
				number = new StringBuilder(String.valueOf(n));
				if(sameNumbers(number)){
					continue;
				}
				//if(counted.get(n) != null) continue;
				//counted.put(n, true);
				countedAux = new HashMap<Integer, Boolean>();
				countedAux.put(n, true);
				
				for(int i = 0; i < number.length()-1; i++){
					first = number.charAt(0);
					number.deleteCharAt(0);
					number.append(first);
					if(number.charAt(0) == '0') {
						continue;
					}
					nAux = Integer.parseInt(number.toString());
					if(nAux > B) {
						continue;
					}
					if(nAux < A) {
						continue;
					}
					if(nAux < n) continue extern;
					//counted.put(nAux, true);
					countedAux.put(nAux, true);
				}
				if(countedAux.size() > 1){
					count += (countedAux.size() * (countedAux.size()-1))/2;
				}
			}
			System.out.println("Case #"+(t+1)+": "+count);
		}
	}
	
	private static boolean sameNumbers(StringBuilder number){
		for(int i = 1; i < number.length(); i++){
			if(number.charAt(i-1) != number.charAt(i)) return false;
		}
		return true;
	}
}
