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.*;
import java.util.*;

public class problemC{
	
	public static void main(String args[]) {
		try{
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			
			int T = Integer.valueOf(br.readLine());
			int count, a, b, base;
			String line;
			String[] lineSplit;
			for(int i = 0; i < T; i++){
				line = br.readLine();
				lineSplit = line.split(" ");
				count = 0;
				a = Integer.valueOf(lineSplit[0]);
				b = Integer.valueOf(lineSplit[1]);
				base = base(a);
				for(int j = a; j < b; j++){
					count += switchAround(j, b, base);
				}
				System.out.println("Case #" + (i+1) + ": " + count);
			}
			
		} catch(Exception e){
			
		}
	}		int div = 10;

	
	public static int switchAround(int num, int max, int base){
		int copy = num;
		int count = 0;
		ArrayList<Integer> listN = new ArrayList<Integer>();
		for(int i = 1; i < base; i *= 10) {
			if(num % 10 == 0) {
				num = num/10;
				continue;
			}
			num = num/10 + (num % 10) * base;
			if(num <= max && num > copy && !listN.contains(num)) {
				count++;
				listN.add(num);
			}
		}
		return count;
	}
	
	public static int base(int num){
		int base = 1;
		while(num/base != 0){
			base *= 10;
		}
		
		return base/10;
	}
}