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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;


public class ProblemC {
	public static void main (String[] args) throws Exception{
		BufferedReader fin = new BufferedReader(new FileReader("E:/C-small-attempt0.in"));
		String line = fin.readLine();
		BufferedWriter out = new BufferedWriter(new FileWriter("E:/C-small-attempt0.out"));
		int ln = 1;
		while ((line = fin.readLine()) != null && line.length() != 0){
			
			line = line.trim();
			String[] parts = line.split("\\s+");
			int a = Integer.parseInt(parts[0]);
			int b = Integer.parseInt(parts[1]);
			int count = 0;
			for (int i = a; i < b; i++){
				String s = Integer.toString(i);
				ArrayList<Integer> list = new ArrayList<Integer>();
				for (int j = 1; j < s.length(); j++){
					String newString = s.substring(j) + s.substring(0,j);
					int newInt = Integer.parseInt(newString);
					if ((newInt > i) && (newInt <= b) && (list.contains(newInt) == false)){
						list.add(newInt);
						count++;
					}
				}
			}
			out.write("Case #" + ln + ": " + count);
			out.write("\n");
			ln++;
		}
		fin.close();
		out.close();
	}
}