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 fr.lcwi.googlecodejam;

import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 * For Google Code Jam 2012
 */
public class ProblemC {

    private static Scanner scanner;
    private static int nbCases;

    public static void main(String[] args) throws IOException {
        String filename = args[0];
        scanner = new Scanner(ProblemC.class.getClassLoader().getResourceAsStream(filename + ".in"));

        nbCases = Integer.valueOf(scanner.nextLine());

        BufferedWriter bWriter = null;
        try {
            bWriter = new BufferedWriter(new FileWriter(filename + ".out"));
            for (int i = 1; i <= nbCases; i++) {
                resolveCase(i, bWriter);
            }
        } finally {
            if (bWriter != null) {
                bWriter.close();
            }
        }
    }

    private static void resolveCase(int caseNb, BufferedWriter bWriter) throws IOException {
        int A = scanner.nextInt();
        int B = scanner.nextInt();

        int result = 0;

        for (int n = A; n < B; n++) {
            Set<Integer> ms = new HashSet<Integer>();
            int length = (int) Math.floor(Math.log10(n)) + 1;

            if (length > 1) {
                for (int i = 0; i < length - 1; i++) {
                    int puissanceA = (int) Math.pow(10, length - i - 1);
                    int puissanceB = (int) Math.pow(10, i + 1);
                    int digitsToMove = n % puissanceB;
                    int ma = digitsToMove * puissanceA;
                    if (ma >= puissanceB) {
                        int mb = n / puissanceB;
                        int m = ma + mb;
                        if (n < m && m < B+1 && !ms.contains(m)) {
                            result++;
                            ms.add(m);
                        }
                    }
                }
            }
        }

        bWriter.write("Case #" + caseNb + ": " + result);
        if (caseNb < nbCases) {
            bWriter.newLine();
        }
    }
}
