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.ArrayList;
import java.util.LinkedList;

public class RecycledNumbers {
	static String[] zeros = { "0", "00", "000", "0000", "00000", "000000" };

	public static void solve(String fname) {
		Read r = new Read();
		r.Read(fname);
		int numOfTestCases = r.noOfTestCases;
		int[] numbers = r.nums;
		String finalAnser = "";
		for (int i = 0; i < numOfTestCases; i++) {
			String answer = "";
			int firstNum = numbers[2 * i];
			int secondNum = numbers[2 * i + 1];
			
			int lastNumIndex = (int) (secondNum / Math.pow(10, ((secondNum+"").length())-1));
			lastNumIndex++;
			String large="";
			for (int k = 9; k >=lastNumIndex; k--) {
				//check large number
				
					large=large+" "+k;
				
				
			}
			// int mid = ((secondNum-firstNum)/2)+1;
			int noOfans = 0;
			for (int j = firstNum; j < secondNum; j++) {
				String numb = j + "";
				int firstIndex = -1;
				int lastIndex = -1;

				for (int k = zeros.length - 1; k >= 0; k--) {
					// check zeros 
					if (numb.contains(zeros[k])) {
						firstIndex = numb.indexOf(zeros[k]);
						//first index of 0 eg in 201000 it will be 3
						lastIndex = firstIndex + zeros[k].length() - 1;
						//last index = 3+(3-1) = 5 
					}
				}
			
			

				// /LinkedList<Integer> number = new LinkedList<Integer>();
				for (int k = 0; (k < numb.length()) ; k++) {
					if(k>=firstIndex&& (k <= lastIndex)&&(!large.contains(numb.charAt(k)+""))){
					//	System.out.println(k);
					}else{
					String first = numb.substring(0, k);
					String last = numb.substring(k, numb.length());
				//	int la = Integer.parseInt(last);
					String newNumb = last + first;
				//	int biggest = (int) (la * Math.pow(10, numb.length()- last.length()));
		
						int numbC = Integer.parseInt(newNumb);
						if ((numbC <= secondNum) && (numbC > j)) {
							noOfans++;
						}
					
				}
				}
				int x = 0;
				// int k=0;
				// while(!number.isEmpty()){
				// x=(int) (x+number.removeLast()*Math.pow(10, k));
				// k++;
				// }

			}
			
			answer = "Case #" + (i + 1) + ": " + noOfans;
		//	System.out.println(answer);
			finalAnser = finalAnser + answer + "\n";

		}
		r.write("out", finalAnser);
		System.out.println(finalAnser);
	}
	public static void main(String[] args) {

		solve("test");
		// String n = "10002";
		// System.out.println(n.lastIndexOf('0'));
	}
}
