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.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.TreeSet;


public class C {
	
	public ArrayList<Integer> hash = new ArrayList<Integer>();
	
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int t = scanner.nextInt();
		for (int i = 0; i < t; i++) {
			C c = new C();
			int y = 0;
			int A = scanner.nextInt();
			int B = scanner.nextInt();
			for (int j = A; j <= B; j++) {
//				if(!c.hash.contains(j)) {
//					System.out.println("j="+j);
					y += c.permut(j, A, B);
//				}
			}
			System.out.println("Case #"+(i+1)+": "+y);
		}
	}
	
	public int permut(int j, int A, int B) {
		int y = 0;
		String sj = ""+j;
		int newJ = 0;
		while(newJ != j) {
			char lastDigit = sj.charAt(sj.length()-1);
			String frontNumber = sj.substring(0, sj.length()-1);
			sj = lastDigit + frontNumber;
			newJ = Integer.parseInt(sj);
//			System.out.print(newJ);
			if(newJ >= A && newJ <= B  && newJ > j) {
				y++;
//				if(!hash.contains(newJ)) {
//					hash.add(newJ);
//					System.out.print(" p");
//				}
			}			
//			System.out.println();
		}
//		System.out.println();
		return y;
	}

}
