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.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.StringTokenizer;

public class ProblemC {
	static long[] pow = new long[12];

	public static void main(String[] args) throws IOException {
		pow[1] = 10;
		for (int i = 2; i < 12; i++)
			pow[i] = pow[i - 1] * 10;
		Scanner input = new Scanner(new FileReader("input"));
		BufferedWriter output = new BufferedWriter(new FileWriter("output"));
		long res;
		int n = input.nextInt();
		for (int j = 1; j <= n; j++) {
			res = solve(input.nextInt(), input.nextInt());
			output.write("Case #" + j + ": " + res);
			output.newLine();
		}
		output.close();
	}

	private static long solve(int a, int b) {
		HashMap<Integer, LinkedList<Integer>> f = new HashMap<Integer, LinkedList<Integer>>();
		long res = 0;
		for (int i = a; i <= b; i++) {
			int s = (i + "").length();
			for (int j = 1; j < s; j++) {
				int c = (int) ((i / pow[j]) + pow[s - j] * (i % pow[j]));
				if (c <= b && c >= a && c != i && (c + "").length() == s) {
					boolean k = f.containsKey(i);
					if (!k)
						f.put(i, new LinkedList<Integer>());
					if (f.containsKey(c)) {
						LinkedList<Integer> w = f.get(c);
						k = w.contains(i);
					}
					if (!k) {
						f.get(i).add(c);
						res++;
					}
				}
			}
		}
		return res;
	}
}