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

public class GC {
	String s  = null;
	String[] sp = null;
	
	
	
	public void run() throws Exception{
		
		BufferedReader br = new BufferedReader(new FileReader("C-large.in"));
		
		BufferedWriter bw = new BufferedWriter(new FileWriter("OUTPUT.txt"));
		s = br.readLine();
		int T = Integer.parseInt(s);
		
		
		int t = 1;
		while(t <= T){
			s = br.readLine();
			sp = s.split(" ");
			long ans = 0;
			int a = Integer.parseInt(sp[0]);
			int b = Integer.parseInt(sp[1]);
			
			if(a < 10){
				a = 10;
			}
			while(a < b){
			
				String sa = Integer.toString(a);
				
				Set<String> set = new HashSet<String>();
				for(int i = 1; i < sa.length(); i++){
					String f = sa.substring(0, i);
					String ba = sa.substring(i);
					String ns = ba + f;
					if(set.contains(ns)){
						continue;
					}
					set.add(ns);
					int nb = Integer.parseInt(ns);
					if(nb > a && nb <= b){
						ans++;
					}
				}

				a++;
			}
			
			bw.write("Case #" + t + ": " + ans +  "\n");

			t++;
		}
		
		bw.close();
	}
	

	
	

	public static void main(String[] args) throws Exception {
		GC b = new GC();
		b.run();
	}

}
