package jp.funnything.competition.util;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.math.BigDecimal;
import java.math.BigInteger;

import org.apache.commons.io.IOUtils;

public class QuestionReader {
    private final BufferedReader _reader;

    public QuestionReader( final File input ) {
        try {
            _reader = new BufferedReader( new FileReader( input ) );
        } catch ( final FileNotFoundException e ) {
            throw new RuntimeException( e );
        }
    }

    public void close() {
        IOUtils.closeQuietly( _reader );
    }

    public String read() {
        try {
            return _reader.readLine();
        } catch ( final IOException e ) {
            throw new RuntimeException( e );
        }
    }

    public BigDecimal[] readBigDecimals() {
        return readBigDecimals( " " );
    }

    public BigDecimal[] readBigDecimals( final String separator ) {
        final String[] tokens = readTokens( separator );

        final BigDecimal[] values = new BigDecimal[ tokens.length ];
        for ( int index = 0 ; index < tokens.length ; index++ ) {
            values[ index ] = new BigDecimal( tokens[ index ] );
        }

        return values;
    }

    public BigInteger[] readBigInts() {
        return readBigInts( " " );
    }

    public BigInteger[] readBigInts( final String separator ) {
        final String[] tokens = readTokens( separator );

        final BigInteger[] values = new BigInteger[ tokens.length ];
        for ( int index = 0 ; index < tokens.length ; index++ ) {
            values[ index ] = new BigInteger( tokens[ index ] );
        }

        return values;
    }

    public int readInt() {
        final int[] values = readInts();

        if ( values.length != 1 ) {
            throw new IllegalStateException( "Try to read single interger, but the line contains zero or multiple values" );
        }

        return values[ 0 ];
    }

    public int[] readInts() {
        return readInts( " " );
    }

    public int[] readInts( final String separator ) {
        final String[] tokens = readTokens( separator );

        final int[] values = new int[ tokens.length ];
        for ( int index = 0 ; index < tokens.length ; index++ ) {
            values[ index ] = Integer.parseInt( tokens[ index ] );
        }

        return values;
    }

    public long readLong() {
        final long[] values = readLongs();

        if ( values.length != 1 ) {
            throw new IllegalStateException( "Try to read single interger, but the line contains zero or multiple values" );
        }

        return values[ 0 ];
    }

    public long[] readLongs() {
        return readLongs( " " );
    }

    public long[] readLongs( final String separator ) {
        final String[] tokens = readTokens( separator );

        final long[] values = new long[ tokens.length ];
        for ( int index = 0 ; index < tokens.length ; index++ ) {
            values[ index ] = Long.parseLong( tokens[ index ] );
        }

        return values;
    }

    public String[] readTokens() {
        return readTokens( " " );
    }

    public String[] readTokens( final String separator ) {
        return read().split( separator );
    }
}

package com.ravi;

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumbers {
	private static boolean matches(String a, String b) {
		if (a.equals(b)) {
			return false;
		}
		for (int j = 0; j < a.length(); j++) {
			if (!b.contains("" + a.charAt(j))) {
				return false;
			}
			// Remove the matched character
			b = b.replaceFirst("" + a.charAt(j), "");
		}
		return true;
	}

	private static Integer getRecycledPairs(String A, String B) {
		int a = Integer.parseInt(A);
		int b = Integer.parseInt(B);
		if (a < 10 || b < 10) {
			return 0;
		}

		Set<String> pairs = new HashSet<>();
		for (int n = a; n <= b; n++) {
			for (int m = a + 1; m <= b; m++) {
				if (n < m) {
					String nStr = n + "";
					String mStr = m + "";
					if (matches(nStr, mStr)) {
						for (int i = 0; i < nStr.length() - 1; i++) {
							String newNStr = nStr.substring(i + 1)
									+ nStr.substring(0, i + 1);
							if (newNStr.equals(mStr)) {
								pairs.add(nStr + "," + mStr);
							}
						}
					}
				}
			}
		}
		return pairs.size();
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		in.nextLine();
		for (int i = 1; i <= T; i++) {
			String thisLine = in.nextLine();
			String[] AB = thisLine.split(" ");
			System.out.println("Case #" + i + ": "
					+ getRecycledPairs(AB[0], AB[1]));
		}
	}
}