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.BufferedReader;
import java.io.FileReader;
import java.util.HashSet;
import java.util.Set;


public class ProblemB {

	public static void main(String[] args) {
		try {
			BufferedReader bufReader = new BufferedReader(new FileReader(args[0]));
		
			int numOfCases = Integer.parseInt(bufReader.readLine());
			int a, b;
			for (int i = 0; i < numOfCases; i++) { // should change 2 to numOfCases!!!
				Set<String> distinctRecycledPairs = new HashSet<String>();
				String line = bufReader.readLine();
				a = Integer.parseInt(line.substring(0, line.indexOf(' ')));
				b = Integer.parseInt(line.substring(line.indexOf(' ') + 1, line.length()));
				//System.out.println("A = " + a + " B = " + b);
				for (int j = a; j <= b; j++) {
					String n = "" + j;
					for (int k = 1; k < n.length(); k++) {
						String possibleM = n.substring(k) + n.substring(0, k);
						if (Integer.parseInt(possibleM) > Integer.parseInt(n)  && Integer.parseInt(possibleM) >= a && Integer.parseInt(possibleM) <= b) {
							// the pair (n,m) may repeat, so use a set
							// there should be a better way though
							distinctRecycledPairs.add(n + " " + possibleM);
						}
					}
				}
				System.out.println("Case #" + (i+1) + ": " + distinctRecycledPairs.size());
			}
			
			bufReader.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

}
