package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

import java.io.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;


public class TaskC {

	static int numberLength;
	
	public static void main(String[] args ) throws FileNotFoundException {
		File fileName = new File("taskc.txt");
		Scanner inFile = new Scanner(fileName);
		int n = inFile.nextInt();
		inFile.useDelimiter("\\r?\\n");
		String[] cases = new String[n];
		for (int i = 0; i < n; i++)
			cases[i] = inFile.next();
		List<String> result = new ArrayList<String>();
		for (String caseString: cases) {
			int recycledNumbers = 0;
			Scanner caseScanner = new Scanner(caseString);
			String lowerBoundString = caseScanner.next();
			int lowerBound = Integer.parseInt(lowerBoundString);
			int upperBound = caseScanner.nextInt();
			for (int i = lowerBound; i <= upperBound; i++) {
				String iString = new Integer(i).toString();
				for (int j = i + 1; j <= upperBound; j++) {
					String jString = new Integer(j).toString();
					if (evaluate(iString, jString))
						recycledNumbers++;
				}
			}
			result.add("" + recycledNumbers);
		}
		
		for (int i = 0; i < result.size(); i++) {
			System.out.println("Case #" + (i+1) + ": " + result.get(i));
		}
	}

	private static boolean evaluate(String iString, String jString) {
		for (int n = 1; n < jString.length(); n++) {
			String testString = jString.substring(n) + jString.substring(0, n);
			if (iString.equals(testString))
				return true;
		}
		return false;
	}
	
}
