import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

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