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.Scanner;


public class Shift {
	public static void main(String[] args) {
		int a,b,c,d=10,e=0,x,T,j;
		int inf,sup,res=0;
		Scanner l = new Scanner(System.in);
		T=l.nextInt();
		for(j=0;j<T;j++){
			inf=l.nextInt();
			sup=l.nextInt();	
			res=0;
			for(int k=inf;k<=sup;k++){
				x=k;
				int vixi=k;
				c=0;
				e=0;
				while(vixi>0){
					vixi=vixi/10;
					e++;		
				}
				for(int i=0;i<e&&c!=k;i++){
					a=x%d;
					b=x/d;
					c= (a*(int)Math.pow(10, e-1)+b);
					if((c>k)&&(c<=sup)&&(c>=inf))
						res++;
					//System.out.println(c);
					x=c;
				}
			}
			System.out.println("Case #"+(j+1)+": "+res);
		}
	
	}
}
