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.*;
import java.util.*;

public class RecycledNumbers
{
    static String moveToFront (String nStr, int size){
        return nStr.substring(nStr.length()-size, nStr.length()) + nStr.substring( 0, nStr.length() - size);
    }
    static boolean isRecycle (int n, int m){
        String nStr = Integer.toString( n );
        String mStr = Integer.toString( m );
        for (int size = 1; size < nStr.length(); size++){
            if (moveToFront(nStr,size).equals(mStr))
                return true;
        }
        return false;
    }
    static HashMap<Integer, LinkedList<Integer>> possibleNM (int a, int b)
    {
        String bStr = Integer.toString( b );
        HashMap<Integer,LinkedList<Integer>> map = new HashMap<Integer,LinkedList<Integer>>();
        for ( int i = a; i < b; i++){
            LinkedList<Integer> list = new LinkedList<Integer>();
            if ( Integer.toString(i).length() > bStr.length())
                break;
            for ( int j = i + 1; j <= b; j++)
                list.add( j );
            map.put( i, list);
        }
        return map;
    }
    public static void main (String[] args) throws IOException
    {
        BufferedReader reader = new BufferedReader(new FileReader("recycle.in"));
        int T = Integer.parseInt(reader.readLine());
        int output = 0;
        int a,b;
        HashMap<Integer,LinkedList<Integer>> possibleNM;
        LinkedList<Integer> list;
        for ( int i = 0; i < T; i++){
            StringTokenizer st= new StringTokenizer(reader.readLine());
            a = Integer.parseInt( st.nextToken() );
            b = Integer.parseInt( st.nextToken() );
            possibleNM = possibleNM(a,b);
            for ( int j = a; j <b; j++){
                try{
                    list = possibleNM.get(j);
                    for (int k = 0; k < list.size(); k++){
                        //if (j == 146 && list.get(k) == 461)
                            //System.out.println("j = " + j);
                        if ( isRecycle(j,list.get(k))){
                            //System.out.println(j+","+list.get( k ));
                            output++;
                        }
                    }
                }
                catch (NullPointerException e){
                }
            }
            System.out.println("Case #" +(i+1) + ": " + output);
            output = 0;
        }   
    }
}