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

public class Solution {
	public void doMain() throws Exception {
		BufferedReader in = new BufferedReader(new FileReader("input.txt"));
		PrintWriter pw = new PrintWriter(new FileWriter("output.txt"));		
		int CaseNumber = Integer.parseInt(in.readLine());		
		for (int cas=1; cas <= CaseNumber; cas++) {
			int nbr = 0 ;			
			String[] str = in.readLine().split(" ");
			int A = Integer.parseInt(str[0]);
			int B = Integer.parseInt(str[1]);
			if(A < 10) {
				pw.println("Case #"+cas+": "+nbr);
			}
			else if(A==B){
				pw.println("Case #"+cas+": "+nbr);
			}
			else{
				ArrayList<String> n = new ArrayList<String>();
				for(int i=A; i<=B; i++){
					String st = Integer.toString(i);
					int l = st.length();
					for(int j=l-1; j>0 ; j--){
						String s = st;
						s = s.substring(j) + s;
						s = s.substring(0,l);
						
						if(Integer.parseInt(s) >A && Integer.parseInt(s) <B && Integer.parseInt(s)!=i && !n.contains(""+i+"-"+s) && !n.contains(s+"-"+i)){
							n.add(s+"-"+i);
							n.add(""+i+"-"+s);
							nbr++;
						}
					}	
				}
				pw.println("Case #"+cas+": "+nbr);
			}
		}
		
		in.close();
		pw.flush();
		pw.close();
	}
	
	public static void main(String[] args) throws Exception {
		(new Solution()).doMain();
	}
}