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.util.HashSet;
import java.util.Scanner;
import java.util.regex.Pattern;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author alvin
 */
public class RecycledNumbers {
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        
        int nTC = sc.nextInt();
        for (int tc = 1; tc <= nTC; tc++) {
            int hasil = 0;
            
            int a = sc.nextInt(), b = sc.nextInt();
            
            String batas = Integer.toString(b);
            char maks = batas.charAt(0);
            
            int panjang = batas.length();
            
            for (int n = a; n < b; n++) {
                String s = Integer.toString(n);
                
                if (s.length() == 1) {
                    // System.out.println(s);
                    continue;
                }
                
                if (Pattern.compile("^(.)\\1*$").matcher(s).matches()) {
                    // System.out.println(s);
                    continue;
                }
                
                HashSet<String> sudah = new HashSet<String>();
                for (int i = s.length() - 1; i >= 1; i--) {
                    char c = s.charAt(i);
                    if (c == '0') {
                        continue;
                    }
                    
                    if (c < s.charAt(0)) {
                        continue;
                    }
                    
                    if (c > maks) {
                        continue;
                    }
                    
                    StringBuilder sb = new StringBuilder(panjang);
                    String cek = sb.append(s.substring(i)).append(s.substring(0, i)).toString();
                    
                    if ((cek.compareTo(s) > 0) && (cek.compareTo(batas) <= 0)) {
                        sudah.add(cek);
                    }
                }
                
                hasil += sudah.size();
            }
            
            System.out.format("Case #%d: %d\n", tc, hasil);
        }
    }
    
}
