package fixjava;

public class StringUtils {

	/** Repeat the given string the requested number of times. */
	public static String repeat(String str, int numTimes) {
		StringBuilder buf = new StringBuilder(Math.max(0, str.length() * numTimes));
		for (int i = 0; i < numTimes; i++)
			buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the left hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padLeft(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(padChar);
		for (int i = 1, mi = bufSize - str.length(); i < mi; i++)
			buf.append(padChar);
		buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the right hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padRight(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(str);
		buf.append(padChar);
		while (buf.length() < bufSize)
			buf.append(padChar);
		return buf.toString();
	}

	/** Intern all strings in an array, skipping null elements. */
	public static String[] intern(String[] arr) {
		for (int i = 0; i < arr.length; i++)
			arr[i] = arr[i].intern();
		return arr;
	}

	/** Intern a string, ignoring null */
	public static String intern(String str) {
		return str == null ? null : str.intern();
	}

}

import java.util.*;

public class Main{
	static int power(int d)
	{
		if(d== 0) return 1;
		else if(d%2 == 0) 
		{
			int a = power(d/2);
			return a*a;
		}
		else
		{
			int a = power(d/2);
			return a*a*10;
		}
	}
	public static void main(String [] args)
	{
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for(int cc = 1; cc<= T; cc++)
		{
			int A = in.nextInt();
			int B = in.nextInt();
			int Digit = Integer.toString(A).length();
			int tab[] = new int[2000001];
			int base = power(Digit-1);
			for(int i = 0; i<2000001; i++)
			{
				tab[i] = -1;
			}
			for(int i = A; i<B; i++)
			{
				if(tab[i] == -1)
				{
					tab[i] = 1;
					int current = i;
					for(int j = 0; j<Digit-1; j++)
					{
						int a = current%10;
						int b = current/10;
						int next = a*base+b;
						//System.out.println(next);
						if(next >= A && next <=B)
						{
							if(tab[next] == -1)
							{
								tab[next] =0;
								tab[i] ++;
							}
						}
						current = next;
					}
				}
			}
			long res = 0;
			for(int i = A; i<B; i++)
			{
				res += tab[i]*(tab[i]-1)/2;
			}
			System.out.println("Case #"+cc+": "+res);
		}
	}
}