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 arg[]){
		int T;
		Scanner cin=new Scanner(System.in);
		T=cin.nextInt();
		for(int t=0;t<T;t++){
			int n=cin.nextInt();
			int m=cin.nextInt();
			int ans=0;
			for(int i=n;i<m;i++){
////				if(i>150)
//					break;
				int size=1;
				int num=0;
				while (true){
					num++;
					if(i>=size && i<size*10)
						break;
					else size*=10;
				}
				int copy=i;
		//		String sc=((Integer)i).toString();
				ArrayList<Integer> now= new ArrayList();
				for(int j=0;j<num-1;j++){
		//			sc=new String(sc.substring(1)+sc.substring(0,1));
		//			int tmp=Integer.parseInt(sc);
					copy=10*(copy%size)+copy/size;

		//			if(copy!=tmp){
		//				System.out.println("ERR----------");
		//			}
			//		System.out.println(i + " " +copy);
					if(copy>i && copy <=m && now.indexOf(copy)==-1){
						ans++;
					//	System.out.println(" " + i + " " +copy);
						now.add(copy);
					}
				}
			}
			System.out.println( "Case #" +( t+1 )+ ": " + ans );
		}
	}
}
