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 );
    }
}

package ProblemC;

import java.io.*;
import java.util.StringTokenizer;

public class RecycledNums {

	/**
	 * @param args
	 */
	
	public RecycledNums(){
		
	}
	
	
	public static void recycledNums() throws IOException{
		BufferedReader rdr = new BufferedReader(new FileReader("C-small-attempt0.in"));
        PrintWriter pw = new PrintWriter(new FileWriter("C.out"));
        int cases = Integer.parseInt(rdr.readLine());

        for (int i = 0; i < cases; i++) {
			String line = rdr.readLine();
            StringTokenizer st = new StringTokenizer(line);
			int A = Integer.parseInt(st.nextToken());
			int B = Integer.parseInt(st.nextToken());
			int result = 0;
			
			for (int n=A; n<B; n++){
				for (int m=n+1; m<=B; m++){
					String ns = n+"";
					String ms = m+"";
					//System.out.println("n "+n+" m "+m);
					if(ns.length() == ms.length()){
						for(int j=ns.length()-1 ; j>0; j--){
							//System.out.println(ns+" "+ms.substring(j, ns.length())+" "+ms.substring(0, j));
							if(ms.equals(ns.substring(j, ms.length())+ns.substring(0, j))){
								result++;
								break;
								//System.out.println(n+" "+m);
							}
						}
					}
				}
			}
			
			
            pw.println("Case #"+(i+1)+": "+result);
        }
        

        pw.close();
        rdr.close();
	}
	
	public static void main(String[] args)throws IOException {
		// TODO Auto-generated method stub
		recycledNums();
	}

}
