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.*;
import java.util.*;
import java.math.*;

public class C {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner input = new Scanner(new File("input.txt"));
		PrintWriter output = new PrintWriter("output.txt");
		int T = input.nextInt();
		for (int z = 1; z <= T; z++) {
			//SOLVE CASE
			int N = input.nextInt();
			int M = input.nextInt();
			int count = 0;
			for (int i = N; i < M; i++) for (int j = i+1; j <= M; j++) {
				String sN = Integer.toString(i);
				sN += sN;
				if (isRecycled(sN, j))
					count++;
			}
			
			
			//PRINT CASE OUTPUT
			System.out.println("Case #" + z + ": " + count);
			output.println("Case #" + z + ": " + count);
		}
		output.close();
	}
	
	public static boolean isRecycled(String sN, int M) {
		String sM = Integer.toString(M);
		if (sN.contains(sM))
			return true;
		return false;
	}
}
