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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class C {
	public static void main(String[] args) {
		try {
			int num;
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			String str = null;
			str = br.readLine();
			num = Integer.parseInt(str);
			for (int i = 0; i < num; i++) {
				String s = br.readLine();
				String arr[] = s.split("\\s+");
				int num1 = Integer.parseInt(arr[0]);
				int num2 = Integer.parseInt(arr[1]);
				int count = 0;
				for (int j = num1; j <= num2; j++) {
					String originalStr = "" + j;
					String numStr = originalStr;
					do {
						numStr = numStr.substring(1) + numStr.charAt(0);
						if (numStr.compareTo(originalStr) > 0) {
							if (Integer.parseInt(numStr) <= num2)
							count++;
						}
					} while (!numStr.equals(originalStr));
				}
				System.out.println("Case #" + (i+1) + ": " + count);
			}
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
}	