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.InputStreamReader;
import java.util.ArrayList;
import java.util.Scanner;


public class Recycle {

	
	public static int Search(String a, String b){
		if(a.length() != b.length())
			return 0;
		else{
			ArrayList<String> chk = new ArrayList<String>();
			int counter=0;
			for(int i=0; i<a.length(); i++){
				if((!chk.contains(a))&& a.equals(b))
					counter++;
				chk.add(a);
				a = a.substring(1)+a.charAt(0);
			}
			return counter;
		}
	}
	
	public static void main(String[] args) {
		Scanner scan = new Scanner(new InputStreamReader(System.in));
		int cases = Integer.parseInt(scan.next());
		int count=1;
		while(cases >0){
			int a = Integer.parseInt(scan.next());
			int b = Integer.parseInt(scan.next());
			int tmp = a;
			int noOfRec=0;
			while(tmp< b){
				for(int b2=b; b2>tmp; b2--){
					int no = Search(""+tmp, ""+b2);
					noOfRec += no;
				}
				tmp++;
			}
			System.out.println("Case #"+count+": "+noOfRec);
			count++;
			cases--;
		}

	}

}
