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.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.HashSet;
import java.util.TreeMap;


public class Recycler {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		String input;
		BufferedReader br;
		HashSet<String> set;
		try{
			br=new BufferedReader(new InputStreamReader(System.in));
			int T=Integer.parseInt(br.readLine());
			int A,B;
			String []inputs;
			for (int i=0;i<T;i++)
			{
				input=br.readLine();
				inputs=input.split(" ");
				A=Integer.parseInt(inputs[0]);
				B=Integer.parseInt(inputs[1]);
				set=new HashSet<String>();
				
				int s=0;
				int m;
				for (int n=A;n<=B;n++)
				{
					int multiple=10;
					while (1.0*n/multiple > 0)
					{
						m=Integer.parseInt(n%multiple + "" + n/multiple);
						if (m<=B && n<m)
						{
							s++;
							set.add(n+""+m);
						}
						multiple*=10;
					}
					
				}
				System.out.println("Case #"+ (i+1) + ": " +set.size());
			}
		}catch(Exception e)
		{
			
		}
	}

}
