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.FileNotFoundException;
import java.util.HashSet;
import java.util.Scanner;


public class RecycledNumbers 
{
	static HashSet<String> set;
	public static int solve(int A, int B)
	{
		int count = 0;
		for(int n = A; n < B;n++)
		{
			String temp = n+"";
			int len = temp.length();
			for(int j = 0;j < len-1;j++)
			{
				temp = temp.charAt(len-1)+temp.substring(0,len-1);
				
				int m = Integer.parseInt(temp);
				if(set.contains(""+m))
					continue;
				if(m > n && m <= B)
					count++;
					
				set.add(""+m);
			}
			set.clear();
			
		}
		return count;
	}
	public static void main(String[] args) 
	{
		set = new HashSet<String>();
		Scanner sc = null;
		try {
			sc = new Scanner(new File("C:\\Users\\oibe\\Desktop\\C-small-attempt1.in"));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		
		int numCases = Integer.parseInt(sc.nextLine());
		for(int i = 1; i <= numCases;i++)
		{
			String[] vals = sc.nextLine().split(" ");
			int A = Integer.parseInt(vals[0]);
			int B = Integer.parseInt(vals[1]);
			System.out.println("Case #"+i+": "+solve(A,B));
		}
	}

}
