import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

@SuppressWarnings( "nls" )
public class R0C
{
  public static void main( final String[] args ) throws IOException
  {
    final Scanner in = new Scanner( new File( "R0C.txt" ) );
    final FileWriter out = new FileWriter( "R0C.out" );

    final int n = in.nextInt();
    in.skip( in.delimiter() );

    for( int i = 0; i < n; i++ )
      out.write( "Case #" + (i+1) + ": " + countAllRecycledNumbersBetween( in.nextInt(), in.nextInt() ) + "\n" );

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

  static int countAllRecycledNumbersBetween( final int a, final int b )
  {
    final int digits = 1 + (int)Math.floor( Math.log10( a ) );
    final int firstDigitMult = (int)Math.pow( 10., digits - 1 );

    final boolean[] visited = new boolean[ b - a + 1 ];
    int count = 0;

    for( int i = 0; i <= b - a; i++ )
    {
      if( visited[ i ] ) continue;
      visited[ i ] = true;
      int subCount = 1;

      int x = a + i;

      for( int j = 1; j < digits; j++ )
      {
        x = x / 10 + x % 10 * firstDigitMult;

        if( ( x >= a ) && ( x <= b ) && !visited[ x - a ] )
        {
          visited[ x - a ] = true;
          subCount++;
        }
      }

      count += subCount * ( subCount - 1 ) / 2;
    }

    return count;
  }
}
