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 Java{

	public static void main(String[] args) {
		try {
			BufferedReader in = new BufferedReader(new FileReader("C-small-attempt1.in"));
			int cases = Integer.parseInt(in.readLine());
			for (int i = 1; i <= cases; i ++){
				String[] temp = (in.readLine()).split(" ");
				int A = Integer.parseInt(temp[0]);
				int B = Integer.parseInt(temp[1]);
				logic(A, B, i);
			}
			in.close();
		} catch (IOException e) {
			System.out.println("INPUT ERROR");
		}
	}

	public static void logic(int A, int B, int caseNum){
		int num = A, result = 0;
		while (num < B){
			int factor = 10;
			int toFront = num%factor;
			int toBack = num/factor;
			int prev = -1;
			while (toFront < num){
				int x = Integer.parseInt(toFront+""+toBack);
				if (x > num && x <= B && x != prev){
					result ++;
					prev = x;
				}
				factor *= 10;
				toFront = num%factor;
				toBack = num/factor;
			}
			num ++;
		}
		System.out.println("Case #" + caseNum + ": " + result);
	}
}