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.*;
import java.util.*;
public class Prob3 {
	public static PrintStream out;
	public static int caseNum;
	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(new File("in.txt"));
		out = new PrintStream(new File("out.txt"));
		int numCases = Integer.parseInt(sc.nextLine());
		caseNum = 0;
		for(int i=0; i<numCases; i++)
			solve(sc.nextLine());
	}
	public static void solve(String input){
		StringTokenizer st = new StringTokenizer(input, " ");
		int from = Integer.parseInt(st.nextToken());
		int to = Integer.parseInt(st.nextToken());
		int numDigits = (int) Math.floor(Math.log10(from)) + 1;
		int digitsPow10 = (int) Math.pow(10, numDigits-1);
		int numPairs = 0;
		for(int i=from; i<=to; i++){
			int recycled = recycle(i, digitsPow10);
			while(recycled != i){
				if(recycled>=from && recycled<=to)
					numPairs++;
				recycled = recycle(recycled, digitsPow10);
			}
		}
		caseNum++;
		out.println("Case #"+caseNum+": "+(numPairs/2));
	}
	public static int recycle(int num, int digitsPow10){
		while(true){
			int lastDigit = num%10;
			num = lastDigit*digitsPow10 + num/10;
			if(lastDigit!=0)
				break;
		}
		return num;
	}
}