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.awt.datatransfer.StringSelection;
import java.util.*;
public class q3 {

	public static void main(String[] args) {
		new q3().run();
	}
	Scanner input = new Scanner(System.in);
	void run(){
		int c = input.nextInt();
		for(int i=1;i<=c;i++){
			System.out.print("Case #"+i+": ");
			solve();
		}
	}
	void solve(){
		int a = input.nextInt();
		int b = input.nextInt();
		boolean [] used = new boolean [b+1];
		int ans = 0;
		String x;
		int i,j,k,y;
		for(i=a;i<=b;i++){
			x = Integer.toString(i);;
			for(j=1;j<=x.length()-1;j++){
				y = recycled(x,j);
				//System.out.println(y);
				if(y >= a && y <= b && !used[y] && i!=y){
					//System.out.println(i +" "+y);
					ans++;
				}
			}
			used[i] = true;
		}	
		System.out.println(ans);
	}
	int recycled(String x,int n){
		String f = x.substring(x.length()-n,x.length());
		int i;
		for(i=0;i<f.length() && f.charAt(i) == '0';i++)
		f = f.substring(i+1,f.length());
		String l = x.substring(0,x.length()-n);
		f = f.concat(l);
		return Integer.parseInt(f);
	}

}
