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.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.BitSet;


public class ProbC {
	
	public static long solve(int A, int B) {
		int[] basePower = new int[8];
		basePower[0] =1;
		for(int i=1; i<8; i++)
			basePower[i] = basePower[i-1] * 10;
		
		long count = 0;
		BitSet mask = new BitSet(B+1);
		int[] digits = new int[8];
		
		for(int i=A; i<=B; i++) {
			if(mask.get(i)) continue;
			mask.set(i);
			int candidate = i;
			int nCandidates = 1;
			int size = 0;
			while(candidate > 0) {
				digits[size] = candidate % 10;
				candidate /= 10;
				size++;
			}
			if(size > 1) {
			   for(int j=0; j<size-1; j++) {
				   int part1 = 0;
				   int part2 = 0;
				   for(int k=j; k>=0; k--) {
					   part1 = part1 * 10 + digits[k];
				   }
				   for(int k=size-1; k>j; k--) {
					   part2 = part2 * 10 + digits[k];
				   }
				   
				   if(part1 != 0) {
					   int value = part1 * basePower[size-1-j] + part2;
					   if(value >= A && value <=B && !mask.get(value)) {
						   nCandidates++;
						   mask.set(value);
					   }
				   }
			   }
			   count += (nCandidates-1) * nCandidates/2;
			}
		}
		return count;
	}
	
	public static void main(String[] args) throws Exception {
		BufferedReader in = new BufferedReader(new FileReader("C-large.in"));
		PrintWriter out = new PrintWriter(new FileWriter("C-large.out"));
		String line = in.readLine();
		int T = Integer.parseInt(line);
		for(int i=1; i<=T; i++) {
			line = in.readLine();
			String[] comp = line.split("\\s+");
			int A = Integer.parseInt(comp[0]);
			int B = Integer.parseInt(comp[1]);
			
			out.print("Case #" + i+ ": ");
			out.println(solve(A, B));
		}
		
		out.flush();
		in.close();
		out.close();
	}
}
