package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

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

	}

	



	

}
