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.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Num {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try {
			String fname = "C-small-attempt0";
			FileInputStream fstream = new FileInputStream(fname + ".in");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			int numCase = 0;
			int i = 0;
			while ((strLine = br.readLine()) != null) {
				if (numCase == 0)
					numCase = Integer.valueOf(strLine);
				else if (strLine.length() > 0)
					runCase(strLine, ++i);
			}
			in.close();
		} catch (Exception e) {// Catch exception if any
			e.printStackTrace();
		}
	}

	static void runCase(String line, int caseNum) {
		String[] borders = line.split(" ");
		int length = borders[0].length();
		int a = Integer.valueOf(borders[0]);
		int b = Integer.valueOf(borders[1]);
		HashSet<String> pairs = new HashSet<String>();
		for (int i = a; i <= b; i++) {
			for (int j = 1; j < length; j++) {
				int pos = (int) Math.pow(10, j);
				int pair = i / pos + (i % pos) * (int) Math.pow(10, length - j);
				if (pair >= a && pair <= b && pair != i) {
					if (i < pair)
						pairs.add(i + "," + pair);
					else
						pairs.add(pair + "," + i);
				}
			}
		}
		System.out.println("Case #" + caseNum + ": " + pairs.size());
	}
}
