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 C {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		for (int i = 0; i < n; i++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			long output = solve(a, b);
			System.out.println("Case #" + (i + 1) + ": " + output);
		}
	}

	private static long solve(int a, int b) {
		if (b <= 10)
			return 0;
		int start = a;
		
		if(a <= 10) start = 11;
		
		int count = 0;
		Set<Integer> found = new HashSet<Integer>();
		for(int i = start; i < b; i++){
			String toshift = String.valueOf(i);
			int len = toshift.length();
			
			for(int j =1; j<len;j++){
				String shifted = shift(toshift, j);
				int v = Integer.valueOf(shifted);
				if(v <= b && v >a && i < v && !found.contains(v) && !shifted.startsWith("0")) {
					found.add(v);
					count++;
				}
			}
			found.clear();
		}
		return count;
	}

	private static String shift(String toshift, int j) {
		String pre = toshift.substring(0, j);
		String post = toshift.substring(j);
		return post.concat(pre);
	}
}
