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.*;
import java.io.*;
public class Rec{
	public static void rotateArray(char[] array, int amount) 
	{ 
		for( int j=0; j<amount; j++) {
			char a = array[0];
			int i;
			for(i = 0; i < array.length-1; i++){
				array[i] = array[i+1];
			}
			array[array.length-1]= a;
		}
	}
	public static boolean check(int a,int b,int c){
		return (c <=b && c>=a);
	}
	public static boolean sameElem(char[] c){
		for(int i=0;i<c.length-1;i++){
			if(c[i]!=c[i+1])
				return false;
		}
		return true;
	}
	public static boolean equal(char[] a,char[] b){
		for(int i=0;i<a.length;i++){
			if(a[i]!=b[i])
				return false;
		}
		return true;
	}
	public static void main(String args[])throws Exception{
		BufferedReader br = new BufferedReader(new FileReader("C-large.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("c.out"));
		String num = br.readLine();
		String line = br.readLine();
		
		int casenum=1;
		while(line!=null){
			String[] nums = line.split(" ");
			int a = Integer.parseInt(nums[0]);
			int b = Integer.parseInt(nums[1]);
			int digits = nums[0].length();
			int ctr=0;
			if(digits<=1){
				pw.println("Case #"+casenum+": "+0);
				casenum++;
				line = br.readLine();
				continue;
			}
			
			for(int i=a;i<=b;i++){
				String cmp = Integer.toString(i);
				LinkedHashSet<String> set = new LinkedHashSet<String>();
				char[] arr = cmp.toCharArray();
				int range=0;
				int equal=0;
				for(int j=0;j<digits-1;j++){
					rotateArray(arr,1);
					if(sameElem(arr))
						continue;
					String sss = new String(arr);
					if(sss.equals(cmp))
						continue;
					if(set.contains(sss))
						continue;
					if(check(a,b,Integer.parseInt(sss))){
						set.add(sss);
					}
				}
				ctr+=set.size();
			}
			pw.println("Case #"+casenum+": "+(ctr/2));
			casenum++;
			line = br.readLine();
		}
		pw.flush();
	}
}