import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;


public class RecycledNumbers {

	public static void main ( String [] arg ) throws NumberFormatException, IOException{
		BufferedReader reader = new BufferedReader(new FileReader(new File("input")));
		PrintWriter output = new PrintWriter(new File("output"));
		
		int cases = Integer.valueOf( reader.readLine() ); 
		for ( int c=1; c<=cases; c++ ){
			StringTokenizer tkn = new StringTokenizer( reader.readLine() ); 
			int a = Integer.valueOf( tkn.nextToken() ); 
			int b = Integer.valueOf( tkn.nextToken() ); 
			int sol=0; 
			//Set<String> superMap = new HashSet(); 
			
			for ( int k=a; k<b; k++ ){
				Set<String> aux = new HashSet();
				String sr = k + ""; 
				for ( int i=1; i<sr.length(); i++ ){
					
					int next = Integer.valueOf( (String)sr.subSequence(i, sr.length()) + (String)sr.subSequence(0, i) );
					if ( k<next && next<=b ){
						//System.out.println( k + "," + next );//+ " " +)
						if ( !aux.contains( next + "") ){
							sol++; 
							aux.add( next + "");
						} else {
							System.out.println(  next );
						}
					}
				}
			}
			System.out.println("Case #"+c+": "+sol);
			output.println( "Case #"+c+": "+sol );
		}
		output.close(); 
	}
	
}
