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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.Scanner;

public class C {
	static long[] ten;

	public static void main(String[] args) throws IOException {
		initializeTens();

		Scanner in = new Scanner(new FileReader("input.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("output"));

		int T = in.nextInt(), start, end;
		for (int i = 1; i <= T; i++) {
			start = in.nextInt(); end = in.nextInt();
			int ans = cntPairs(start, end);
			bw.write("Case #" + i + ": " + ans);
			bw.newLine();
		}

		bw.close();
		System.out.println("end");
	}

	private static int cntPairs(int start, int end) {
		boolean[] v = new boolean[end+1];
		
		int cnt = 0;
		for(int i = start; i <= end; i++)
			if(!v[i])
				cnt += getPairs(i, start, end, v);
		
		return cnt;
	}

	private static int getPairs(int n, int start, int end, boolean[] v) {
		HashSet<Integer> set = new HashSet<Integer>();
		
		int len = getLength(n), cnt = 0;
		v[n] = true;
		
		for (int i = 1; i < len; i++) {
			long num = n * ten[i];
			num = num + n / ten[len - i];
			num = num % ten[len];

			int res = (int) num;
			if (res >= start && res <= end && len == getLength(res) && !v[res] && !set.contains(res)){
				set.add(res);
				cnt++;
			}
		}
		return cnt;
	}

	public static int getLength(int n) {
		return (int) (Math.log10(n) + 1e-6) + 1;
	}

	private static void initializeTens() {
		ten = new long[8];
		ten[1] = 10;
		for (int i = 2; i < ten.length; i++)
			ten[i] = 10 * ten[i - 1];
	}
}

/*
Case #1: 2498449

 *
 */

/*
Case #1: 615
Case #2: 0
Case #3: 680
Case #4: 732
Case #5: 622
Case #6: 536
Case #7: 0
Case #8: 721
Case #9: 719
Case #10: 0
Case #11: 730
Case #12: 560
Case #13: 590
Case #14: 742
Case #15: 596
Case #16: 738
Case #17: 604
Case #18: 662
Case #19: 670
Case #20: 6
Case #21: 614
Case #22: 640
Case #23: 684
Case #24: 757
Case #25: 608
Case #26: 697
Case #27: 780
Case #28: 646
Case #29: 776
Case #30: 199
Case #31: 624
Case #32: 602
Case #33: 748
Case #34: 728
Case #35: 6
Case #36: 628
Case #37: 718
Case #38: 634
Case #39: 674
Case #40: 609
Case #41: 0
Case #42: 695
Case #43: 637
Case #44: 0
Case #45: 744
Case #46: 1
Case #47: 36
Case #48: 801
Case #49: 192
Case #50: 724
*/