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.*;
import java.math.*;

public class C{

	public static int func(int x, int M){
		int tmp,d=0,i;
		
		int a[] = new int[10];
		d = 0;
		tmp = x;
		while(tmp > 0){
			a[d] = tmp % 10;
			tmp /= 10;
			d++;
		}
		
		int ten = 1;
		for(i=0;i<d-1;i++) ten *= 10;
		
		int y[] = new int[d];
		tmp = x;
		for(i=0;i<d;i++){
			y[i] = tmp;
			tmp = tmp / 10 + ten * a[i];
		}
		
		Arrays.sort(y);
		
		int ans = 0;
		for(i=0;i<d;i++) if(y[i] > x && y[i] <= M && (i == 0 || y[i] != y[i-1])) ans++;
		return ans;
	}

	public static void main(String args[]){
		int T,t,A,B,i;
		
		Scanner scan = new Scanner(System.in);
		
		T = scan.nextInt();
		
		for(t=0;t<T;t++){
			A = scan.nextInt();
			B = scan.nextInt();
			
			int ans = 0;
			for(i=A;i<=B;i++) ans += func(i,B);
			
			System.out.printf("Case #%d: %d\n", t+1, ans);
		}
	}

}
