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

public class ProblemCLarge {

	public static void main(String[] args) throws Exception {

		// Scanner sc = new Scanner(new File("C:\\C-Large.in"));
		Scanner sc = new Scanner(System.in);
		int cases = Integer.parseInt(sc.nextLine().trim());
		for (int i = 0; i < cases; i++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			System.out.println("Case #" + (i + 1) + ": " + solve(a, b));
		}
	}

	private static int solve(int a, int b) {
		int count = 0;
		int num_digs = ("" + a).length();
		int[] power = new int[] { 1, 10, 100, 1000, 10000, 100000, 1000000,
				10000000 };

		for (int i = a; i <= b; i++) {
			int[] tmp = new int[10];
			int cnt = 0;

			for (int j = 1; j < num_digs; j++) {
				boolean found = false;
				
				if (i % power[j] > 0) {
					int tmp1 = (i % power[j]) * power[num_digs - j];

					int tmp2 = (i - (i % power[j])) / power[j];

					int tmp3 = tmp1 + tmp2;

					if (cnt == 0) {
						tmp[cnt++] = tmp3;
					} else {
						for (int k = 0; k < cnt; k++) {
							if (tmp3 == tmp[k]) {
								found = true;
							}
						}
						if(!found){
							tmp[cnt++] = tmp3;
						}
					}
				}
			}

			for (int tmp4 : tmp) {
				if (tmp4 >= a && tmp4 <= b && tmp4 != i) {
					//System.out.println(i + " " + tmp4);
					count++;
				}
			}
		}

		return count / 2;
	}

}
