import java.io.*;
import java.util.*;

class B
{
	public static void main(String[] args) 
	{
		try
		{
			BufferedReader br = new BufferedReader(new FileReader("B.in"));
			PrintWriter pw = new PrintWriter(new FileWriter("B.out"));
			int X = Integer.parseInt(br.readLine());

			for(int i=0; i<X; i++)
			{
				String[] S = br.readLine().split(" ");
				int A = Integer.parseInt(S[0]);
				int B = Integer.parseInt(S[1]);
				int R = 0;

				int x = 1;
				int n = 0;
				while(A/x > 0) {
					n++;
					x *= 10;
				}

				for(int j=A; j<B; j++) {
					Set<Integer> seen = new HashSet<Integer>();
					for(int k=1; k<n; k++) {
						int p1 = j % (int)Math.pow(10, k);
						int p2 = (int) Math.pow(10, n-k);
						int p3 = j / (int)Math.pow(10, k);
						int y = p1*p2 + p3;
						
						if(j < y && !seen.contains(y) && y <= B) {
							seen.add(y);
							R++;
						}
					}
				}

				pw.printf("Case #%d: %d\n", i+1, R);
				pw.flush();
			}
		}
		catch(Exception e)
		{ 
			e.printStackTrace();
		}
	}
}

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;


public class RecycledNumbers {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int noCases = in.nextInt();
		
		for(int i = 0; i < noCases; i++){
			int a = in.nextInt();
			int b = in.nextInt();
			int noDigits = Integer.toString(a).length();
			Set<Pair> checkedPairs = new HashSet<Pair>();
			
			for(int number = a; number <= b; number++){
				for (int digit = 1; digit < noDigits; digit++) {
					if(number % Math.pow(10, digit) == 0){
						continue;
					}
					int rotatedNumber = rotate(number, digit, noDigits);
					Pair pair = new Pair(rotatedNumber,number);
					if (rotatedNumber >= a && rotatedNumber <= b
							&& !checkedPairs.contains(pair)
							&& number != rotatedNumber) {
						checkedPairs.add(pair);
					}
				}
			}
			
			System.out.println("Case #"+(i+1)+": " + checkedPairs.size());
		}
	}
	
	
	static class Pair{
		int value1, value2;
		public Pair(int value1, int value2){
			this.value1 = value1;
			this.value2 = value2;
		}
		
		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + (value1+value2);
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Pair other = (Pair) obj;
			if (value1 != other.value1 && value1 != other.value2)
				return false;
			if (value2 != other.value2 && value2 != other.value1)
				return false;
			return true;
		}
		public String toString(){
			return "("+value1+","+value2+")";
		}
	}
	
	public static int rotate(int number, int noPlaces, int noDigits){
		int rotatedNumber = number;
		int divider = (int) Math.pow(10, noDigits-1);
		for(int i = 0; i < noPlaces; i++){
			int digit = rotatedNumber % 10;
			rotatedNumber = digit*divider + rotatedNumber / 10;
		}
		return rotatedNumber;
		
	}

}
