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.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;



public class RecycledNumbers {

	private final String inputFile = "D:\\input.in";
	private final String outputFile = "D:\\output.out";
	private static  class TestCase{
		int a;
		int b;
		public int calculateRecycleds(){
			int result = 0;
			for (int i = a; i <= b; i++){
				int numDigits = getNumDigits(i);
				int lastResycled = -1;
				for (int j = 0, divisor = 10; j < numDigits - 1; j++, divisor *= 10){
					int recycled = i % divisor;
					for (int k = 0; k < numDigits - j - 1; k++){
						recycled *= 10;
					}
					recycled += (i / divisor);
					if (isInRange(recycled) && recycled > i && lastResycled != recycled){
						result ++;
						lastResycled = recycled;
					}
				}
				
			}
			return result;
		}
		private int getNumDigits(int i){
			int numDigits = 0;
			while (i > 0){
				numDigits++;
				i /= 10;
			}
			return numDigits;
		}
		private boolean isInRange(int i){
			return (i >= a) && (i <= b);
		}
	}
	List<TestCase> input =  new ArrayList<RecycledNumbers.TestCase>();
	public void parseInput(){
		try {
			BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
			int numTestCases = Integer.parseInt(br.readLine());
			for (int i = 0; i < numTestCases; i++){
				String [] lineTokens = br.readLine().split(" ");
				TestCase tc = new TestCase();
				tc.a = Integer.parseInt(lineTokens[0]);
				tc.b = Integer.parseInt(lineTokens[1]);
				input.add(tc);
			}			
			br.close();
			} catch (Exception e) {
				e.printStackTrace();
			}
	}
	public void doOutput(){
		try {
			PrintWriter pw = new  PrintWriter(new FileOutputStream(outputFile));
			
			for (int i = 0; i < input.size(); i++){
				TestCase tc = input.get(i);
				pw.println("Case #" + (i + 1) + ": " + tc.calculateRecycleds());
			}
			pw.flush();
			pw.close();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
	}
	
	public static void main(String [] args){
		RecycledNumbers rn  = new RecycledNumbers();
		rn.parseInput();
		rn.doOutput();
	}
}
