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


public class C {
	
	
	int A = 0;
	int B = 0;
	int cnt = 0;
	
	public int getDig(int x){
		int temp = x;
		int dig = 0;
		while(temp>0){
			dig++;
			temp/=10;		
		}
		return dig;
		
	}
	
	public int flip(int x, int time){
		int temp = x;
		int base = 1;
		for(int i = 1; i<=time;i++) base*=10; 
		int last = temp %base;
		
		
		for(int i = 1; i<=time; i++) temp/=10;		
		for(int i = 1; i<=getDig(x)-time; i++) last*=10;
		
		int ans = last + temp;	
		return ans;
	}
	
	public void getPair(int x){
		if (x<10) return;
		
		
		int dig = getDig(x);
		
		for (int i = 1; i<=dig-1;i++){
			int next = flip(x,i);
			if (dig!=getDig(A)) continue;
			if (next<x) continue;
			if (next==x) break;
			if (next>B||next<A) continue;
//			System.out.println(x+","+next);
			cnt++;
		}		
		return;
	}
	
	public C(Scanner input){
		int T = input.nextInt();
		for(int tt= 1; tt<=T;tt++){
			
			A =input.nextInt();
			B =input.nextInt();
				
			cnt = 0;

			for(int i = A; i<=B; i++){
				getPair(i);				
			}
			System.out.println("Case #"+tt+": "+cnt);
		}
		
	}
	
	public static void main(String args[]){
		new C(new Scanner(System.in));
	}
}
/*
4
1 9
10 40
100 500
1111 2222


*/