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.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Cbits {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner scan = new Scanner(new File("C-large.in"));
		System.setOut(new PrintStream("C-large.out"));

		int t = scan.nextInt();
		for (int c = 0; c < t; c++) {
			int a = scan.nextInt();
			int b = scan.nextInt();
			int ans = 0;
			int bDigits = digits(b);

			for (int n = a; n < b; n++) {
				int nDigits = digits(n);
				int nDigitCount = numDigits(n);
				Set<Integer> done = new HashSet<Integer>();
				for (int i = 1; i < nDigitCount; i++) {
					int mDigits = rotate(nDigits, nDigitCount, i);
					if (nDigits < mDigits && mDigits <= bDigits
					        && !done.contains(mDigits)) {
						ans++;
						done.add(mDigits);
					}
				}
			}

			System.out.printf("Case #%d: %d%n", c + 1, ans);
		}
	}

	private static int numDigits(int n) {
		int num = 0;
		int temp = n;
		while (temp > 0) {
			num++;
			temp /= 10;
		}
		return num;
	}

	private static int digits(int n) {
		int num = numDigits(n);

		int digits = 0;
		int temp = n;
		for (int i = 0; i < num; i++) {
			digits |= (temp % 10) << i * 4;
			temp /= 10;
		}
		return digits;
	}

	private static int rotate(int nDigits, int digitCount, int r) {
		int rotPartMask = (1 << r * 4) - 1;
		int rotPart = nDigits & rotPartMask;

		int ans = nDigits;
		ans >>>= r * 4;
		ans |= rotPart << (digitCount - r) * 4;

		return ans;
	}

	private static int normal(int n, int digitCount) {
		int base = 1;
		int ans = 0;
		for (int i = 0; i < digitCount; i++) {
			int mask = 0b1111 << i * 4;
			int digit = (n & mask) >>> i * 4;
			ans += digit * base;
			base *= 10;
		}
		return ans;
	}
}