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.BufferedReader;
import java.io.IOException;
import java.io.StringReader;
import java.util.HashSet;
import java.util.Set;


public class Recycled {

	public static void main(String [] args) throws NumberFormatException, IOException
	{
		BufferedReader in = new BufferedReader(new StringReader(args[0]));
		int rows = Integer.parseInt(in.readLine());
		for ( int i = 1; i <= rows; i++)
		{			
			String line = in.readLine();
			String [] tokens = line.split(" ");
			int low = Integer.parseInt(tokens[0]);
			int high = Integer.parseInt(tokens[1]);
			
			int count = 0;
			Set<String> used = new HashSet<String>();
			for ( int j = low; j <= high; j++ )
			{
				String str = Integer.toString(j);
				//System.out.println("Original: " + str);
				for ( int k = 0; k < str.length()-1; k++ )
				{
					String newStr = str.substring(k+1) + str.substring(0,k+1);
					int newInt = Integer.parseInt(newStr); 
					if ( Integer.toString(j).length() == Integer.toString(newInt).length() &&
							
							newInt<=high && 
							!used.contains(j+","+newInt)
							&& !used.contains(newInt+","+j) 
							&& j < newInt )
					{
						count++;
						used.add(j+","+newInt);
					}
				}
			}
			System.out.println("Case #"+i+": " + count);
			//System.out.println(used);
			
			
		}
	}
	
}
