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

public class recycle{
    static class pair{
        int a,b;
        @Override
        public int hashCode(){ return a^b;}
        @Override
        public boolean equals(Object o){
            pair p = (pair)o;
            return p.a == a && p.b == b;
        }
    }

    public static void main(String args[]) throws Exception{
        Scanner s=  new Scanner(System.in);
        int nu= s.nextInt(); s.nextLine();
        int casen=1;while (nu-->0){
        
            int A = s.nextInt(); int B = s.nextInt(); 
                try{s.nextLine();}catch(Exception e){}
            Set<pair> pairs = new HashSet<pair>();
            long num=0;
            for (int i= A; i <=B;i++){
                int k=i;
                int digits = 0; int mult = 1;
                while (k>0){ digits++; k/=10; mult *= 10; }

                k=i; int sum = 0; 
                int m2 = 1;
                while (k>0){
                    sum += m2*(k%10);
                    boolean zero =k%10 == 0;
                    mult/=10;
                    k/=10;
                    int a = i;
                    int b = sum*mult+k;
                    if (!zero && b >= A && b <= B && a!=b){
                            pair p = new pair();
                            p.a = b; 
                            p.b = i;
                        if(!pairs.contains(p)) {
                            p.a = i; p.b=b;
                            if (!pairs.contains(p)){
                            num++;pairs.add(p);
                         //   System.out.println(p.a + "-"+p.b);
                            }
                        }
                    }
                    m2*=10;
                }
            }
            System.out.println("Case #"+casen++ +": "+ num);
       } 
    }
}
