import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.io.File;
import java.io.IOException;
import java.util.HashSet;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) throws IOException {
		Scanner scanner = new Scanner(new File("c:\\eclipse\\3\\C-small-attempt0.in"));
		int numTc = scanner.nextInt();
		for (int index = 0; index < numTc; index++) {
			int result = 0;
			int a = scanner.nextInt();
			int b = scanner.nextInt();
			for (int i = a; i <= b; i++) {
				if (i < 10) continue;
				int num = findNumPairs(i, a, b);
				result += num;
			}
			System.out.println("Case #" + (index + 1) + ": " + result/2);
		}
	}
	private static int findNumPairs(int num, int a, int b) {
		
		char[] origStr = String.valueOf(num).toCharArray();
		int len = origStr.length;
		char[] newStr = new char[len];
		int result = 0;
		int startIndex = 1;
		HashSet<Integer> consumedSet = new HashSet<Integer>();
		do {
			if (startIndex == len) {
				break;
			}
 			int idx = 0;
			for (int i = startIndex; i < len; i++) {
				newStr[idx++] = origStr[i];
			}
			for (int i = 0; i < startIndex; i++) {
				newStr[idx++] = origStr[i];
			}
			startIndex++;
			int newNum = Integer.parseInt(String.valueOf(newStr));
			if (newNum < a || newNum > b || newNum == num || consumedSet.contains(newNum)) {
				continue;
			}
			result++;
			consumedSet.add(newNum);
		} while(true);
		return result;
	}
}