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.*;
import java.io.*;

public class C {
	public static void main(String[] args) throws Exception {
		String inputfilename = args[0];
		String outputfilename = args[1];
		BufferedReader br = new BufferedReader(new FileReader(inputfilename));
		BufferedWriter bw = new BufferedWriter(new FileWriter(outputfilename));
		int cases = Integer.valueOf(br.readLine());
		for(int i = 0; i < cases; i++) {
			String[] ele = br.readLine().split(" ");
			int A = Integer.valueOf(ele[0]);
			int B = Integer.valueOf(ele[1]);
			int result = C.solve(A,B);
			bw.write("Case #" + (i + 1) + ": " + result + "\n");
		}
		br.close();
		bw.close();
	}
	
	public static int solve(int A,int B) {
		int cnt = 0;
		//System.out.println("\nDoing " + A + " " + B);
		String Astr = String.valueOf(A);
		String Bstr = String.valueOf(B);
		for(int cur = A; cur <= B; cur++) {
			String cstr = String.valueOf(cur);
			//System.out.println("\n" + cstr + "\n");
			Set<String> tset = new HashSet<String>();
			for(int i = 1; i < cstr.length(); i++)
			{
				String tmp = cstr.substring(i) + cstr.substring(0,i);
				//System.out.println(" " + tmp);
				if(tmp.compareTo(cstr) > 0 && tmp.compareTo(Bstr) <= 0 && !tset.contains(tmp)) {
					cnt++;
					tset.add(tmp);
					//System.out.print(" " + cstr + "!!" +tmp);
				}
			}
		}
		return cnt;
	}
}