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.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.util.Scanner;

public class Main {

	/**
	 * @param args
	 */

	static boolean isRecycled(String s1, String s2) {
		if (s1.length() != s2.length())
			return false;

		if (s1.compareTo(s2) == 0)
			return true;

		for (int i = 0; i < s1.length(); i++) {
			char c = s1.charAt(0);
			s1 = s1.substring(1);
			s1 += c;

			if (s1.compareTo(s2) == 0)
				return true;
		}

		return false;
	}

	static int solve(int A, int B) {

		int count = 0;
		for (int i = A; i <= B; i++)
			for (int j = i + 1; j <= B; j++) {
				if (isRecycled(Integer.toString(i), Integer.toString(j)))
					count++;
				// System.out.println();
			}
		return count;

	}

	public static void main(String[] args) throws Exception {

		Scanner scanner = new Scanner(new File("input.txt"));
		BufferedWriter writer = new BufferedWriter(new FileWriter("output.txt"));

		int N = scanner.nextInt();
		for (int i = 1; i <= N; i++) {
			int A = scanner.nextInt();
			int B = scanner.nextInt();
			int res = solve(A,B);
			writer.append("Case #" + i + ": " + res);
			writer.newLine();
		}
		writer.close();
		scanner.close();

	}

}
