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

public class RecNumbers {
	
	static Scanner in;
	static PrintWriter out;
	
	
	public static boolean isRecycled(int n, int m){
		boolean recycled = false;
		String first = Integer.toString(n);
		String second = Integer.toString(m);
		int len = first.length();
		
		for(int i = 0; i < len; i++){
			if(len > 2){
				first = "" + first.charAt(len - 1) + first.substring(0,len - 1);	
			} else if (len == 2){
				first = "" + first.charAt(1) + first.charAt(0);
			} else {
				return false;
			}
			
			if(first.equals(second)){
				recycled = true;
			}
		}
		
		return recycled;
	}
	
	public static void main(String[] args) throws Exception {
		in = new Scanner(new File("C-small-attempt0.in"));
		out = new PrintWriter(new File("C-small.out"));

		//Read file
		int A;
		int B;
		int T = in.nextInt();
		//for each case do
		for (int i = 1; i <= T; i++){
			A = in.nextInt();
			B = in.nextInt();
			int count = 0;
			out.print("Case #" + i + ": ");
			for(int j = A; j <= B; j++){
				for(int k = j + 1; k <= B; k++){
					if(isRecycled(j, k) && j > 10 && k > 10){
						count++;
					}
				}
			}
			out.print(count);
			out.println();
		}

		out.close();	
	}
}