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

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
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;
		
	}

}
