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);
		}
	}
}
public class Main {
	public static void main(String[] args) throws java.io.FileNotFoundException,java.io.IOException{
		java.io.BufferedReader bRead=new java.io.BufferedReader(new java.io.FileReader("F:\\C-large.in"));
		java.io.BufferedWriter bWrite=new java.io.BufferedWriter(new java.io.FileWriter("F:\\C-large.out"));
		java.util.HashMap<Integer,Integer> mVals=new java.util.HashMap<Integer,Integer>();
		StringBuffer output=new StringBuffer();		
		int noCases=Integer.parseInt(bRead.readLine());
		for(int i=0;i<noCases;i++){	
			String[] curLine=bRead.readLine().split(" ");
			int A=Integer.parseInt(curLine[0]),B=Integer.parseInt(curLine[1]),dig=curLine[0].length(),n=A,noPairs=0;
			while(n<B){
				int m;mVals.clear();
				for(int j=1;j<dig;j++){
					m=((n%(int)Math.pow(10,dig-j))*(int)Math.pow(10,j))+n/((int)Math.pow(10,dig-j));
					if(m>n&&m<=B&&!mVals.containsKey(m)){noPairs++;mVals.put(m,0);}
				}
				n++;
			}
			output.append("Case #"+(i+1)+": "+noPairs+"\n");
		}
		bWrite.write(output.toString());
		bWrite.close();bRead.close();
	}
}
