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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Set;


public class RecycledNumbers {
  public static String input = "easy.txt";
  public static void main(String[] args) throws IOException {
    BufferedReader in = new BufferedReader(new FileReader(input));
    
    int n = Integer.parseInt(in.readLine());
    for (int i = 1; i <= n; i++) {
      String line = in.readLine();
      int idx1 = line.indexOf(' ');
      int a = Integer.parseInt(line.substring(0, idx1));
      int b = Integer.parseInt(line.substring(idx1 + 1));
      
      long totalCount = 0;
      Map<Map<Integer, Integer>, Long> signatureMap = new HashMap<Map<Integer, Integer>, Long>();
      
      for (int x = a; x <= b; x++) {
        totalCount += recycledNums(x, b);
      }
      
      System.out.println("Case #" + i + ": " + totalCount);
    }
  }

  private static int recycledNums (int n, int max) {
    List<Integer> digits = new LinkedList<Integer>();
    
    int remaining = n;
    while (remaining > 0) {
      int digit = remaining % 10;
      digits.add(digit);
      remaining /= 10;
    }
    
    //System.out.println("<<" + n + ">>");
    Set<Integer> nums = new HashSet<Integer>();
    for (int i = 0; i < digits.size() - 1; i++) {
      int n0 = digits.remove(0);
      digits.add(n0);
      int recycled = numFromList(digits);
      //System.out.println(recycled);
      if (recycled > n && recycled <= max) nums.add(recycled);
    }
    
    //System.out.println(n + ": " + nums);
    
    return nums.size();
  }
  
  private static int numFromList(List<Integer> list) {
    int num = 0;
    for (int i = list.size() - 1; i >= 0; i--) {
      num *= 10;
      num += list.get(i);
    }
    return num;
  }
}
