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.embege.codejam;

import java.util.Arrays;
import java.util.Scanner;

public class CJ2012QualiCRecycled
{

	static int len(int n)
	{
		int c = 1;
		while ((n = n/10) > 0) c++;
		return c;
	}
	
	static boolean checkDigits(int a, int b)
	{
		if (len(a) != len(b)) return false;
		
		String sa = Integer.toString(a);
		String sb = Integer.toString(b);
		
		char []ca = sa.toCharArray();
		char []cb = sb.toCharArray();
		
		Arrays.sort(ca);
		Arrays.sort(cb);
		int len = ca.length;

		for(int i = 0; i < len; i++)
		  if(cb[i] != ca[i])
		    return false;

		return true;
		/*
		for (int i=0; i<sa.length();++i)
		{
			if (!sb.contains( sa.substring(i,i+1)  )) return false;
			if (!sa.contains( sb.substring(i,i+1)  )) return false;
		}
		
		return true;
		*/
	}
	
	static boolean permut(int a, int b)
	{
		String sa = ""+a;
		String sb = ""+b;
		
		for (int x = 1; x<sa.length()+1; x++)
		{
			String part1 = sa.substring(0, x);
			String part2 = sa.substring(x, sa.length());
			
			String n = part2+part1;
			if (n.equals(sb)) return true;
		}
		return false;
	}
	
	public static void main(String[] args)
	{
		final Scanner in = new Scanner(System.in);
		final int T = in.nextInt();
		for (int t = 0; t < T; t++)
		{
			int A = in.nextInt();
			int B = in.nextInt();			
			int x = 0;
			
			for (int i=A; i<B;++i) 
			{
				for (int j=i+1; j<=B;++j) 
				{
					if (checkDigits(i, j))
					{
						if (permut(i, j))
						{
							x++;
						}
					}
				}
			}
			

			System.out.format("Case #%d: %d\n", (t+1), x );
		}
	}

}
