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.File;
import java.io.FileReader;
import java.util.ArrayList;

public class Pairs {

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

		BufferedReader fis = new BufferedReader(new FileReader(
				new File("input")));
		String numCasesStr = fis.readLine();
		int numCases = Integer.parseInt(numCasesStr);
		String val = "";
		int caseNum = 1;
		while ((val = fis.readLine()) != null) {
			String out = eval(val);
			System.out.println("Case #" + caseNum + ": " + out);
			caseNum++;
		}

	}

	private static String eval(String val) {
		String[] vals = val.split(" ");
		int a = Integer.parseInt(vals[0]);
		int b = Integer.parseInt(vals[1]);
		
		int out = 0;
		ArrayList<String> ss = new ArrayList<String>();
		
		if (b > 10 && a != b) {
			for(int i = a; i <= b; i++) {
				//Are there any rotations of i which is less than b
				String m = "" + i;
				for(int j = 0; j < m.length()-1; j++) {
					m = m.substring(1) + m.substring(0, 1);
					if(m.startsWith("0")) {
						continue;
					}
					int n = Integer.parseInt(m);
					if(n <= b && n > i) {
						String v = i  + " , " + m;
						if(!ss.contains(v)) {
							//Skip cases such as ???????1212 , 2121
							ss.add(v);
							out++;
						}
						
					}
				}
			}
		}
		
		return "" + out;
	}
	

}
