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

public class B {
	int a, b;
	
	int countRec(int num){
		char[] digits = String.valueOf(num).toCharArray();
		int n = digits.length;
		char[] rec = new char[n];
		HashSet<Integer> set = new HashSet<Integer>();
		int cnt=0;
		
		for(int i=1; i<n; i++){
			int index = i;
			for(int j=0; j<n; j++, index++){
				if(index>=n) index%=n;				
				rec[j] = digits[index];
			}
			
			int out = Integer.parseInt(String.valueOf(rec));
			if(out > num && out <= b && !set.contains(out)){
				cnt++;
				set.add(out);
			}
		}
		
		return cnt;
	}
	
	public void run() throws IOException{
		BufferedReader bf = new BufferedReader(new FileReader("b.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("b.out"));
		
		int kases = Integer.parseInt(bf.readLine());
		for(int kase=1; kase<=kases; kase++){
			String[] in = bf.readLine().trim().split("[ ]+");
			a = Integer.parseInt(in[0]);
			b = Integer.parseInt(in[1]);
			
			long ret = 0;
			for(int i=a; i<=b; i++) ret+= countRec(i);
			
			pw.println("Case #" + kase + ": " + ret);
		}
		
		pw.close();
	}
	
	public static void main(String[] args) throws IOException {
		new B().run();
	}
}
