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.*;

public class ProblemC {
	public static void main(String[] args) {
		try {
			// Create file
			FileWriter fstream = new FileWriter("out.txt");
			BufferedWriter out = new BufferedWriter(fstream);
			// Close the output stream
			Scanner in = new Scanner(System.in);
			int count = in.nextInt();
			for (int i=1; i<=count; i++){
				int A = in.nextInt();
				int B = in.nextInt();
				int ret = 0;
				for (int j=A; j<B; j++){
					for (int k=j+1; k<=B; k++){
						if (areRecycledPair(j,k)) ret++;
					}
				}
				String s = "Case #" + i + ": " + ret + "\n";
				out.write(s);
			}
			
			
			
			out.close();
		} catch (Exception e) {// Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
	}
	
	public static boolean areRecycledPair(int A, int B){
		String a = A + "";
		String b = B + "";
		for (int i=0; i<a.length(); i++){
			a = a.charAt(a.length()-1) + a.substring(0,a.length() - 1);
			if (a.equals(b)) return true;
		}
		return false;
	}
}

