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 {
		Scanner sc = new Scanner(new FileReader("/home/vivek/workspace/codejam2012problem2/src/input.txt"));
		PrintWriter pw = new PrintWriter(new FileWriter("/home/vivek/workspace/codejam2012problem2/src/output.txt"));
		//Scanner sc = new Scanner(System.in);
		//PrintWriter pw = new PrintWriter(System.out);
		int T = sc.nextInt();
		//sc.nextLine();		
		for (int j = 0; j < T; j++) {
			long a = sc.nextLong();
			long b = sc.nextLong();
			int count=0;
			pw.print("Case #" + (j + 1) + ": ");			
			for(long i=a;i<=b;i++){
				String N=i+"";
				String M=i+"";int n=M.length();				
				int check=0;
				List<Long> al=new ArrayList<Long>();
				for(int k=0;k<n;k++){					
					M=M.charAt(n-1)+M;
					M=M.substring(0,n);	
					if(!al.contains(new Long(Long.parseLong(M))) &&  Long.parseLong(M)<=b && Long.parseLong(N)<Long.parseLong(M) && a<Long.parseLong(M))
						count++;
					al.add(Long.parseLong(M));
					
				}							
			}			
			pw.println(count);
		}		
		pw.flush();
		pw.close();
		sc.close();
	}
	
	public static void main(String[] args) throws Exception {
		new Solution().doMain();
	}
}