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.Scanner;


public class RecycledNumbers {

	public static int Recycled(int k,int begin,int end){
		int length =String.valueOf(k).length();
		int inc=0;
		int con=(int) Math.pow(10,length);
		int div=1;
		int temp;
		for(int i=1;i<length;i++){
			div*=10;
			con/=10;
			temp=(k%div)*con+(k/div);
			if(temp>k){
			if(temp>=begin&&temp<=end){
				inc++;
			}
			}
		}
		return inc;
	}
	public static int testcase(int begin,int end){
		int inc=0;
		for(int i=begin;i<=end;i++){
			inc+=Recycled(i,begin,end);
		}
		return inc;
	}
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int T = scan.nextInt();
		for(int i=0;i<T;i++){
			System.out.println("Case #"+(i+1)+": "+testcase(scan.nextInt(),scan.nextInt()));
		}
	}

}
