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.Scanner;


public class Recycled {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		String inStr = null;
		int numCases = 0;
		
		
		try {
			inStr = br.readLine();
			numCases = Integer.parseInt(inStr);
			for (int i = 0; i < numCases; i++) {
				inStr = br.readLine();
				System.out.println("Case #" + (i+1) + ": " + checkNums(inStr));
			}
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
	
	public static int checkNums(String s) {
		int [] n, m;
		int length, A, B;

		int result = 0;
		Scanner ints = new Scanner(s);
		
		A = ints.nextInt();
		B = ints.nextInt();
		
		length = (s.length()-1) / 2;
				
		n = new int[length];
		m = new int[length];
		
		for (int i = A; i < B; i++) {
			for (int j = i+1; j <= B; j++) {
				String nStr = "" + i;
				String mStr = "" + j;
				
				for (int x = 0; x < length; x++) {
					n[x] = nStr.charAt(x) - 48;
					m[x] = mStr.charAt(x) - 48;
				}
				for (int x = 0; x < length - 1; x++) {
					int tempInt = n[length - 1];
					for (int y = length - 1; y > 0; y--) {
						n[y] = n[y-1];
					}
					n[0] = tempInt;
					if (isEqual(n, m, length)) {
						result++;
						break;
					}
				}
				
				
				
				
			}
		}
		

		return result;
	}
	
	public static Boolean isEqual(int[] m, int [] n, int length) {

		for (int i = 0; i < length; i++) {
			if (n[i] != m[i]) return false;
		}
		
		return true;
	}

}
