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.HashMap;
public class RecycledNumbers {
	
	public static void main(String[] arg) {
		String output,line = null;
		int t,a,b, count, caseNum;
		String[] inp; 
		
		try {
			BufferedReader is = new BufferedReader(new FileReader("infile.txt"));
			FileWriter writer = new FileWriter("output.txt");
			line = is.readLine();
			t = Integer.parseInt(line);
			for(caseNum=1; caseNum<=t; caseNum++) {
				line = is.readLine();
				inp = line.split(" ");
				
				a = Integer.parseInt(inp[0].trim());
				b = Integer.parseInt(inp[1].trim());
				
				count = generateRotatedNumbersCount(a, b);
				output = "Case #" + caseNum + ": " + count + "\n";
				writer.write(output.toCharArray());
			}
			writer.close();
		} catch (NumberFormatException ex) {
			System.out.println("Not a valid number: " + line);
		} catch (IOException e) {
			System.out.println("Unexpected IO ERROR: " + e);
		}
	}
	
	public static int generateRotatedNumbersCount(int a, int b) { 
		HashMap<Integer, Boolean> map;
		HashMap<Integer, Boolean> masterList = new HashMap<Integer, Boolean>();
		String num;
		char[] temp;
		int i,j,k,len;
		int n, count=0;
		
		for (k=a; k<=b; k++) {
			if (masterList.containsKey(k))
				continue;
			num = Integer.toString(k);
			char[] digits = num.toCharArray();
			
			len = digits.length;
			
			map = new HashMap<Integer, Boolean>();
			for (i=0; i<len; i++) {
				temp = new char[len];
				for (j=0; j<len; j++) {
					if (i+j<len)
						temp[j] = digits[i + j];
					else
						temp[j] = digits[i + j - len];
				}
				
				n = Integer.parseInt(new String(temp));
				if (n >= a && n <= b) {
					
					map.put(n, true);
					masterList.put(n, true);
				}
			}
			len = map.size();
			count += (len*(len-1))/2;
		}
		return count;
	}
}