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

public class C {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        C th = new C();
        for (int i = 0; i < T; i++) {
            int A = sc.nextInt();
            int B = sc.nextInt();
            int c = th.getAnswer(A, B);
            System.out.println("Case #" + (i+1) + ": " + c);
        }
    }
    public int getAnswer(int A, int B) {
        if (A == B) {
            return 0;
        }
        int count = 0;
        for (int i = A; i < B; i++) {
            String s = "" + i;
            int l = s.length();
            int[] it = new int[l];
            for (int j = 0; j < l; j++) {
                String t = getRotate(s, j+1);
                it[j] = Integer.parseInt(t);
                if (it[j] <= B && it[j] > i) {
                    boolean f = true;
                    for (int k = 0; k < j; k++) {
                        if (it[k] == it[j])
                            f = false;
                    }
                    if (f)
                        count++;
                }
            }
        }
        return count;
    }
    public String getRotate(String s, int r) {
        char[] ch = s.toCharArray();
        int n = ch.length;
        char[] buf = new char[n];
        for (int i = 0; i < r; i++) {
            buf[n-r+i] = ch[i];
        }
        for (int i = 0; i < n-r; i++) {
            buf[i] = ch[r+i];
        }
        return new String(buf);
    }
}

