package jp.funnything.competition.util;

import java.math.BigInteger;

/**
 * Utility for BigInteger
 */
public class BI {
    public static BigInteger ZERO = BigInteger.ZERO;
    public static BigInteger ONE = BigInteger.ONE;

    public static BigInteger add( final BigInteger x , final BigInteger y ) {
        return x.add( y );
    }

    public static BigInteger add( final BigInteger x , final long y ) {
        return add( x , v( y ) );
    }

    public static BigInteger add( final long x , final BigInteger y ) {
        return add( v( x ) , y );
    }

    public static int cmp( final BigInteger x , final BigInteger y ) {
        return x.compareTo( y );
    }

    public static int cmp( final BigInteger x , final long y ) {
        return cmp( x , v( y ) );
    }

    public static int cmp( final long x , final BigInteger y ) {
        return cmp( v( x ) , y );
    }

    public static BigInteger div( final BigInteger x , final BigInteger y ) {
        return x.divide( y );
    }

    public static BigInteger div( final BigInteger x , final long y ) {
        return div( x , v( y ) );
    }

    public static BigInteger div( final long x , final BigInteger y ) {
        return div( v( x ) , y );
    }

    public static BigInteger mod( final BigInteger x , final BigInteger y ) {
        return x.mod( y );
    }

    public static BigInteger mod( final BigInteger x , final long y ) {
        return mod( x , v( y ) );
    }

    public static BigInteger mod( final long x , final BigInteger y ) {
        return mod( v( x ) , y );
    }

    public static BigInteger mul( final BigInteger x , final BigInteger y ) {
        return x.multiply( y );
    }

    public static BigInteger mul( final BigInteger x , final long y ) {
        return mul( x , v( y ) );
    }

    public static BigInteger mul( final long x , final BigInteger y ) {
        return mul( v( x ) , y );
    }

    public static BigInteger sub( final BigInteger x , final BigInteger y ) {
        return x.subtract( y );
    }

    public static BigInteger sub( final BigInteger x , final long y ) {
        return sub( x , v( y ) );
    }

    public static BigInteger sub( final long x , final BigInteger y ) {
        return sub( v( x ) , y );
    }

    public static BigInteger v( final long value ) {
        return BigInteger.valueOf( value );
    }
}

import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;


public class RecycledNumbers {
	public static void main(String[] args) throws IOException{
		Scanner scanner = new Scanner(new File("input.txt"));
		int numCases = scanner.nextInt();
		
		PrintWriter pw = new PrintWriter(new File("output3.txt"));

		for(int i=1; i <= numCases; i++){
			long a = scanner.nextLong();
			long b = scanner.nextLong();
			
			int result = 0;
			// Computer number of digits
			long digits = computeNumOfDigits(a);
			// Iterate over all numbers
			for(long n=a; n <=b; n++){
				long m = n;
				HashSet<Long> generateNumbers = new HashSet<>();
				for(long j = 1; j < digits; j++){
					m = rotateRightMostDigit(m, digits);
					generateNumbers.add(m);				
				}
				
				// Iterate over all numbers generated by each number
				for(Long l:generateNumbers){
					if(computeNumOfDigits(l)==digits && l>n && l<=b){
						result++;
					}	
				}
				
			}
			//System.out.println("Case #" + i + ": " + result);
			pw.println("Case #" + i + ": " + result);
			pw.flush();
		}
	}

	private static long rotateRightMostDigit(long m, long digits) {
		long d = m%10;
		long rightPart = m/10;
		long leftPart = (int) Math.pow(10.0, digits -1);
		long result = (leftPart * d) + rightPart;
		return result;
	}

	private static long computeNumOfDigits(long inputNum) {
		if(inputNum == 0){
			return 1;
		}
		
		long digits = 0;
		
		while(inputNum!=0){
			inputNum = inputNum/10;
			digits++;
		}
		return digits;
	}

}
