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.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;


public class Q3RecycledNumbers {

	public static void main(String[] args) throws FileNotFoundException, IOException {
		Scanner scanner = new Scanner(new File("q3.input"));
		
		FileWriter writer = new FileWriter("q3.output");
		
		int cases = scanner.nextInt();
		
		for (int i = 1; i <= cases; i++) {
			
			int a = scanner.nextInt();
			int b = scanner.nextInt();
			
			int n = solve(a, b);
			
			writer.write("Case #" + i + ": " + n + "\n");
		}
		
		writer.close();
	}

	private static int solve(int a, int b) {
		int n = 0;
		
		for (int i = b; i >= a; i--) {
			String strI = String.valueOf(i);
			Set<Integer> mirrorSet = new HashSet<Integer>();
			
			for (int j = 1; j <= strI.length(); j++) {
				String r = strI.substring(j, strI.length()) + strI.substring(0, j);
				int intR = Integer.valueOf(r);
				if (intR < i && intR >= a && !mirrorSet.contains(intR)) {
					mirrorSet.add(intR);
					n++;
				}
			}
		}
		
		return n;
	}
	
}
