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.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		for (int ti = 0; ti < t; ti++) {
			int a = sc.nextInt(), b = sc.nextInt();
			int sum = 0;
			for (int i = a; i <= b; i++) {
				int numOfDigits, power;
				if (i < 10) {
					numOfDigits = 1;
					power = 1;
				} else if (i < 100) {
					numOfDigits = 2;
					power = 10;
				} else if (i < 1000) {
					numOfDigits = 3;
					power = 100;
				} else if (i < 10000) {
					numOfDigits = 4;
					power = 1000;
				} else if (i < 100000) {
					numOfDigits = 5;
					power = 10000;
				} else if (i < 1000000) {
					numOfDigits = 6;
					power = 100000;
				} else {
					numOfDigits = 7;
					power = 1000000;
				}
				int tmp = i;
				for (int j = 0; j < numOfDigits - 1; j++) {
					int leastSig = tmp % 10;
					tmp = power * leastSig + tmp / 10;
					if (tmp == i)
						break;
					if (leastSig != 0 && tmp < i && tmp >= a)
						sum++;
				}
			}
			System.out.printf("Case #%d: %d%n", ti + 1, sum);
		}
	}
}
