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);
	}
}

/*
 *	3rd task of this years google Code Jam, lets see what I can do 
 */

//Import of java classes and packages
import java.util.Locale;
import java.util.Scanner;

//Body class
public class RecycledNumbers {

	//main class start
	public static void main(String[] args){
		
		Scanner sc = new Scanner(System.in);
		sc.useLocale(Locale.US);
		
		int recycledCount = 0;
		
		int testCount = sc.nextInt();
		
		//This cycle will run for every test (why so obvious?)
		for(int i = 0; i < testCount; i++){
			int first = sc.nextInt();
			int second = sc.nextInt();
			recycledCount = 0;	
			
			for(int j = first; j <= second; j++){
				if(j < 10)
					continue;
				
				String numberString = new String("" + j);
				for(int k = 1; k < numberString.length(); k++){
					String newNumber = new String(numberString.substring(k, numberString.length()) + numberString.substring(0,k));
					//System.out.println(newNumber);
					int number = Integer.parseInt(newNumber);
					if((number > j) && (number <= second))
						recycledCount++;
				}
			}
			
			System.out.println("Case #" + (i+1) + ": " + recycledCount);			
		}
		
	}
	//main class end
}
