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

package Qualification;

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

public class C {
	
	private static boolean checkRecycling2( String n, String m ){
		String last;
		String first;
		int status = 0;
		for( int pos=n.length()-1; pos>0; pos-- ){
			
			last = n.substring(pos);
			first = n.substring(0, pos);
			
			//System.out.println( last + " " + first );
			
			//new Scanner(System.in).nextLine();
			
			if( (last+first).equals( m )){
				return true;
			}
		}
		
		return false;
	}
	
	private static boolean checkRecycling( String n, String m ){
		boolean flag = true;
		int sz = n.length(), mPos;
		for( int pos=sz-1; pos>0; pos-- ){
			flag = true;
			mPos = 0;
			
			for( int i=pos; i<sz; i++ ){
				if( n.charAt(i) != m.charAt( mPos++ ) ){
					flag = false;
					break;
				}
			}
			
			if( !flag ) continue;
			flag = true;
			
			for( int i=0; i<pos; i++ ){
				if( n.charAt(i) != m.charAt( mPos++ ) ){
					flag = false;
					break;
				}
			}
			
			if( flag )
				return true;
			
		}
		
		return false;
	}
	
	private static int getRecycled(String... split) {
		int times=0;
		int a = Integer.parseInt(split[0]);
		int b = Integer.parseInt( split[1] );
		
		String nS, mS;
		
		for( int n=a; n<b; n++ ){
			for( int m=n+1; m<=b; m++ ){
				
				nS = String.format("%d", n);
				mS = String.format("%d", m);
				
				//System.out.println( nS + " " + mS );
				
				if( checkRecycling( nS, mS ) ){
					times++;
				}
				
			}
		}
		
		return times;
	}
	
	public static void main(String[] args) throws FileNotFoundException {
		
		Scanner in = new Scanner( new File( "C-small-attempt1.in" ) );
		//Scanner in = new Scanner( new File( "A-large.in" ) );
		PrintWriter out = new PrintWriter( new FileOutputStream( new File( "outC.txt" ) ), true );
		
		long cases;
		
		cases = Long.parseLong( in.nextLine() );
		
		String input;
		for( long i=0; i<cases; i++  ){
			out.print("Case #" + (i+1) + ": ");
			/*
			 * START 
			 */
			
			input = in.nextLine();
			
			out.print( getRecycled( input.split(" ") ) );
			
			/*
			 *  END
			 */
			out.println();
		}

	}

	



	

}
