import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main {

//	static int MAX = 10000;
	static int MAX = 2000000;
	static Object[] All = new Object[MAX+1];
	
	static int size( int x ) {
		if(x>999999) return 7;
		if(x>99999)  return 6;
		if(x>9999)   return 5;
		if(x>999)    return 4;
		if(x>99)     return 3;
		if(x>9)      return 2;
		return 1;
	}
	static int[] rotate( int value ) {
		List<Integer> result = new ArrayList<Integer>();
		int[] V = new int[8];
		int s = size(value);
		int x = value;
		
		for(int i=s-1;i>=0;i--) {
			V[i] = x%10;
			x /=10;
		}
		int rot;
		for(int i=1; i<s; i++) {
			if(V[i]!=0){
				rot=0;
				for(int j=0,ii=i;j<s; j++,ii=(ii+1)%s){
					rot=rot*10+V[ii];
				}
				if(rot>value && !result.contains(rot))
					result.add(rot);
			}
		}
		if( result.isEmpty() )
			return null;
		int[] r = new int[result.size()];
		for(int i=0; i<r.length; i++)
			r[i]=result.get(i);
		return r;
	}
	
	static void precalculate() {
		for(int i=1; i<=MAX; i++){
			All[i] = rotate(i);
		}
	}
	static int solve( Scanner in ) {
		int A, B, sol=0;
		
		A = in.nextInt();
		B = in.nextInt();

		for( int i=A; i<=B; i++) {
//			List<Integer> result = rotate(i);
			if( All[i]!=null ) {
				for(int value: (int[])All[i] ) {
					if( value <= B )
						sol++;
				}
			}
		}

		return sol;
	}
	
	public static void main ( String args[] ) {
		int T; 
		Scanner in = new Scanner(System.in);
		T = in.nextInt();
		int cnt=0;
		int sol;
		precalculate();
		for( cnt=1; cnt<=T; cnt++ ) {
			sol = solve( in );
			System.out.printf("Case #%d: %d\n", cnt, sol);
		}

	}
}

package codejam2012.qr;

import codejam.common.CodeHelper;
import java.util.ArrayList;
import java.util.List;

/**
 *
 * @author Chen Ling
 */
public class ProblemC {

    private static String SMALL_IN_FILE_NAME = "/codejam2012/qr/C-small.in";
    private static String LARGE_IN_FILE_NAME = "/codejam2012/qr/C-large.in";
    private static String SMALL_OUT_FILE_NAME = "/codejam2012/qr/C-small.out";
    private static String LARGE_OUT_FILE_NAME = "/codejam2012/qr/C-large.out";

    public static int solve(int start, int end) {
        int total = 0;
        for (int number = start; number < end + 1; number++) {
            String pairN = String.valueOf(number);
            if (pairN.length() == 1) {
                continue;
            }
            for (int i = 1; i < pairN.length(); i++) {
                String pairM = pairN.substring(i, pairN.length()) + pairN.substring(0, i);
                int pairMI = Integer.parseInt(pairM);
                if (pairMI >= start && pairMI > number && pairMI <= end) {
                    total++;
//                    System.out.print("Pair(" + pairN + ", " + pairM + ")");
//                    System.out.print(", Ture");
//                    System.out.println("");
                }

            }
        }
//        System.out.println("Total: " + total);
        return total;
    }

    public static void main(String[] args) {
//        ProblemC.solve(1111, 2222);
//        List<String> smallLinesIn = CodeHelper.loadInputLines(SMALL_IN_FILE_NAME);
//        List<String> smallOuts = new ArrayList<String>();
//        for (int i = 1; i < smallLinesIn.size(); i++) {
//            String[] numbers = smallLinesIn.get(i).split(" ");
//            int start = Integer.parseInt(numbers[0]);
//            int end = Integer.parseInt(numbers[1]);
//            smallOuts.add("Case #" + i + ": " + ProblemC.solve(start, end));
//        }
//        CodeHelper.writeOutputs(SMALL_OUT_FILE_NAME, smallOuts);

        List<String> largeLinesIn = CodeHelper.loadInputLines(LARGE_IN_FILE_NAME);
        List<String> largeOuts = new ArrayList<String>();
        for (int i = 1; i < largeLinesIn.size(); i++) {
            String[] numbers = largeLinesIn.get(i).split(" ");
            int start = Integer.parseInt(numbers[0]);
            int end = Integer.parseInt(numbers[1]);
            largeOuts.add("Case #" + i + ": " + ProblemC.solve(start, end));
        }
        CodeHelper.writeOutputs(LARGE_OUT_FILE_NAME, largeOuts);
    }
}
