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);
		}

	}
}

	

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.io.ObjectInputStream.GetField;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
import java.math.BigInteger;

public class C {

    private static char[] alph;
    private static String  fileIN = "./A.in"; //archivo de entrada (en el dir local del programita)
    private static String  fileOUT = "./out.txt"; //salida

    public static void main(String[] args) throws FileNotFoundException {
        Scanner in = new Scanner(new File(fileIN));
        PrintWriter out = new PrintWriter(new File(fileOUT));
        int T = in.nextInt();
        for (int i = 0; i < T; i++) {
            String s = "Case #" + (i + 1) + ": " + new C().solve(in);
            out.println(s);
            System.out.println(s);
         }
        
        
        out.close();
    	//getCombinaciones(1234);
    }
/**
* Retorna la solucion a un caso
**/
    private String solve(Scanner in) {
    	int min, max = 0;
    	min= in.nextInt();
    	max= in.nextInt();
    	int tot = 0;
    	int tot_[] = new int[6];
    	int prov = 0;
    
    	for(int i = min; i< max; i++){
    		for(Integer j: getCombinaciones(i)){
    			//System.out.println(j);
    			if(j>i)
    			if(isValid(j, min, max)) prov++;
    		}
    		tot_[prov]++;
    		tot+= prov;
    		prov =0;
    	}
    /*	for(int i = 0; i < tot_.length; i++){
    		tot-= 
    	}*/
    	
    	return String.valueOf(tot);
    }
    
	private boolean isValid(Integer j, int min, int max) {
		
		return j<=max && j>=min;
	}
	private static List<Integer> getCombinaciones(int i) {
		ArrayList<Integer> l = new ArrayList<Integer>();
		
		String is = String.valueOf(i); 
		String aux = String.valueOf(i);
		if(symetric(is)) return l;
		do{
			aux = aux.charAt(aux.length()-1)+ aux.substring(0, aux.length()-1);
		
			if(aux.charAt(0)!='0')
			l.add(Integer.valueOf(aux));
		}
		while(!is.equals(aux));
		l.remove(l.size()-1);
		
		return l;
	}
	private static boolean symetric(String is) {
		if(is.length() % 2 ==1) return false;
		else return is.substring(0, is.length()/2).equals(is.substring(is.length()/2 + 1, is.length()));
		
	}
	    
    
   
  }

