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;
import java.util.LinkedList;
import java.util.Scanner;

public class leadingZero {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		BufferedReader read = new BufferedReader(new InputStreamReader(
				System.in));
		String ll;
		ll = read.readLine();
		int a = Integer.parseInt(ll);
		for (int k = 0; k < a; k++) {
			Scanner scn=new Scanner(read.readLine());
			int A = scn.nextInt();
			int B = scn.nextInt();
			
			int[] s = new int[20000000];
			for (int i = A; i <= B; i++) {
				String r = i + "";
				int l = i;
				LinkedList<Integer>list=new LinkedList<Integer>();
				
				for (int j = 0; j < r.length() - 1; j++) {
					int b = l % 10;
					l = l / 10 + (int) Math.pow(10, r.length() - 1) * b;
					if (l > i && !list.contains(l))
					{
						s[l]++;
						list.add(l);
					}
				}
			}
			int sum = 0;
			for (int i = A; i <= B; i++) {
				if (s[i] > 0) {
					sum += s[i];
					//System.out.println(i+"  ..  "+s[i]);
				}
			}
			System.out.println("Case #"+(k+1)+": "+sum);
		}
	}

}
