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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class C {
    
    private static boolean isRecyledPair(String n, String m) {
        int l = n.length();
        String s = "";
        
        for (int i = 1; i < l; i++) {
            for (int j = 0; j < l; j++) {
                s += n.charAt((j+i) % (l));
            }
            if (s.equals(m)) {
                return true;
            }
            s = "";
        }
        
        return false;
    }
    
    public static void main(String[] args) {
        try {
            Scanner file = new Scanner(new File(args[0]));
            int T = Integer.parseInt(file.nextLine());
            
            BufferedWriter out = new BufferedWriter(new FileWriter(args[0].substring(0, args[0].length()-2) +"out"));
            for (int i = 0; i < T; i++) {
                int A = file.nextInt();
                int B = file.nextInt();
                
                int ans = 0;
                for (int j = A; j < B; j++) {
                    for (int k = j+1; k <= B; k++) {
                        if (isRecyledPair(String.valueOf(j), String.valueOf(k))) {
                            ans++;
                        }
                    }
                }
                
                out.write(new StringBuilder().append("Case #").append(i+1).append(": ").append(ans).append("\n").toString());
            }
            out.close();
            
        } catch (Exception ex) {
            ex.printStackTrace();
        }
        
    }
}