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 gcj.gcj2012.qualif;

import gcj.SolverBase;

import java.io.BufferedReader;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Set;

public class ProblemC extends SolverBase {

    public ProblemC() {
        super("Recycled Numbers");
    }

    public static void main(String[] args) throws Exception {
        SolverBase problem = new ProblemC();
        // problem.verbose = true;
        problem.solve(System.in, System.out);
    }

    @Override
    public void solveSingle(BufferedReader reader, PrintStream out) throws Exception {
        int[] AB = readSingleLineIntArray(reader);
        int A = AB[0];
        int B = AB[1];

        // How many digits?
        int d = (""+A).length();
        check(d == (""+B).length());

        int x = 0;
        Set<String> done = new HashSet<String>();

        // Naive implementation 1 : full loop
        for(int i=A;i<B;i++){
            for(int k=1;k<d;k++){
                int j = rotate(i,d,k);
                if( i<j && j<=B ){
                    String pair = i+","+j;
                    if( !done.contains(pair) ){
                        x ++;
                        done.add(pair);
                    }
                }
            }
        }

        out.println(x);
    }

    static int[] pows = { 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000 };

    private int rotate(int i, int d, int k) {
        int pow1 = pows[k];
        int pow2 = pows[d-k];
        int bar = i/pow1;
        int foo = pow2 * (i%pow1);
        int j = foo + bar;
        //System.out.println("rotate("+i+","+k+")"+" = "+j);
        return j;
    }
}
