package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.util.Scanner;


public class Recycled {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
	    Scanner s = new Scanner(new File("C:\\Users\\Owner\\Desktop\\a-small.in"));
	    FileOutputStream fos = new FileOutputStream("C:\\Users\\Owner\\Desktop\\a-small.out");
		PrintWriter pw = new PrintWriter(fos);
		
		int testCases = s.nextInt();
		s.nextLine();
		for(int i = 0; i < testCases; ++i){
			int n = s.nextInt();
			int m = s.nextInt();
				
		    int result = 0;
			pw.print("Case #" + (i + 1) +": ");
		
			String nstr ;
			String mstr ;
			String temp;
			for(int k = m; k > n; --k){
				mstr = k + "";
				for(int p = n; p < m && p < k; p++){
					nstr = "" + p;
			        for(int q = 0; q < mstr.length(); ++q){
			        	temp = mstr.substring(0,mstr.length() - 1);
			        	mstr = mstr.charAt(mstr.length() - 1) + temp;
			        	if(mstr.equals(nstr)){
			        		result++;
			        		break;
			        	}
			        }
				}
			}
	
			
			pw.print(result);
		    if(i != testCases - 1) pw.println();
		   
	    }
	    
		pw.close();
		s.close();

	}

}
