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


public class Recycled {
	public static void main (String[] args) { 
		Scanner sc = new Scanner(System.in);
		int lines = sc.nextInt();
		for (int i=0; i<lines; i++) {
			int min = sc.nextInt();
			int max = sc.nextInt();
			
			int count = 0;
			for (int n=min; n<=max; n++) {
				int d = countDigit(n);
				ArrayList<Integer> swappedValues = new ArrayList<Integer>();
				for (int s=1; s<=d; s++) {
					int tens = tenPowerOf(s);
					int headDigits = d-s;
					int head = n/tens;
					int tail = n%tens;
					
					int minTail = minWithNumberOfDigits(s);
					if (tail>=minTail) {
						int newNum = tail*tenPowerOf(headDigits)+head;
						if (newNum>=min && newNum<=max && newNum!=n) {
							int size = swappedValues.size();
							Boolean isNew = true;
							for (int j=0; j<size; j++) {
								int val = swappedValues.get(j);
								if (val==newNum) {
									isNew = false;
									break;
								}
							}
							if (isNew) {
								swappedValues.add(newNum);
								count++;
							}
						}
					}
				}
			}
			
			count /= 2;
			System.out.println("Case #"+(i+1)+": "+count);
		}
	}
	
	static int countDigit (int n) {
		int digits = 1;
		n = n/10;
		while (n>0) {
			digits++;
			n = n/10;
		}
		return digits;
		
	}
	
	static int tenPowerOf(int p) {
		int res = 0;
		if (p>0) {
			res = 10; // power of 1
			for (int i=2; i<=p; i++) {
				res *= 10;
			}
		}
		return res;
	}
	
	static int minWithNumberOfDigits(int d) {
		return tenPowerOf(d-1);
	}
}
