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 countRecycledNumbers(int a,int b){
		int count=0;
		int t[][] = new int[(b-a)+1][(b-a)+1];
		for(int i=0; i<(b-a)+1; i++){
			for(int j=0; j<(b-a)+1; j++){
				t[i][j]=0;
			}
		}
		int max = String.valueOf(a).length();
		for(int j=a; j<=b; j++){
			int n = j;	
			for(int i=1; i<max; i++){
				int m = Integer.parseInt(String.valueOf(n).substring(max-i)+String.valueOf(n).substring(0,max-i));
				if(a<=n && n<m && m<=b){
					if(t[n-a][m-a]==0){
						t[n-a][m-a]=1;
						count++;
					}
				}
			}
		}
		return count;
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int i = 0; i < T; i++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int count = countRecycledNumbers(A,B);
			System.out.println("Case #" + (i + 1) + ": "+count );
		}
	}
}
