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.*;

public class Recycled {
	public static void main(String[] args) {
		
		Scanner p = new Scanner(System.in);
		int tests = p.nextInt();
		
		for(int i = 0; i<tests; i++) {
			int count = 0;
			boolean[] used = new boolean [1001];
			Integer a = p.nextInt();
			Integer b = p.nextInt();
			if( b == 1000 ) {
				b = 999;
			}
			for( ; a<b; a++) {
				if( a < 10 ) {
					a = 10;
				}
				char[] start = ((a.toString()).toCharArray() );
				if(a <= 99) {
					char temp0 = start[0];
					char temp1 = start[1];
					
					start[1] = temp0;
					start[0] = temp1;
					int number1 = Integer.parseInt(new String(start));
					if(number1 <= b && number1 >= a && !used[number1] && number1 != a) {
						used[a] = true;
						count++;
					}
				}
								
				else if(a >= 100) {
					char temp0 = start[0];
					char temp1 = start[1];
					char temp2 = start[2];
					//one rotation
					start[2] = temp1;
					start[1] = temp0;
					start[0] = temp2;
					int number1 = Integer.parseInt(new String(start));
					if(number1 <= b && number1 >= a && !used[number1] && number1 != a) {
						used[a] = true;
						count++;
					}
				
					start[2] = temp0;
					start[1] = temp2;
					start[0] = temp1;
					int number2 = Integer.parseInt(new String(start));
					if(number2 <= b && number2 >= a && !used[number2] && number1 != number2 && number2 != a) {
						used[a] = true;
						count++;
					}
				}
			}
			System.out.println("Case #" + (i+1) + ": " + count);
		}
	}
}

