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.StringTokenizer;


public class C {
	
	static boolean isrecycle (long n, long m){
		
		String a,b;
		char ac[],c;
		int k;
		boolean t=false;
		a=String.valueOf(n);
		b=String.valueOf(m);
		
		
		
		for(int j=1;j<b.length();j++){
			ac=a.toCharArray();
			c=ac[0];k=0;
			for(int i=0;i<ac.length-1;i++){
				ac[i]=ac[i+1];k++;
			}
			ac[k]=c;
			
			if(String.valueOf(ac).compareTo(b)==0) {t=true;break;}
			else a=String.valueOf(ac);
			
		}
		
		return t;
		
	}
	
	
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("C.in"));
		PrintWriter out = new PrintWriter(new FileWriter("C.out"));
		String l;
		int p,count;
		long n,m;
		boolean esc=false;
		
	p=Integer.parseInt(in.readLine());
		
for(int j=1;j<=p;j++){
			
			l=in.readLine();
			StringTokenizer st = new StringTokenizer(l);
			n=Long.parseLong(st.nextToken());
			m=Long.parseLong(st.nextToken());
			count=0;
			
			for(long q=n;q<=m;q++)
				for(long r=q+1;r<=m;r++)
			{
				if(C.isrecycle(r, q)) count++;
			}
						
			if(esc==true) out.println();
			else esc=true;
			out.print("Case #"+j+": "+count);
			
			
}
in.close();
out.close();
		
	}

}
