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.ArrayList;
import java.util.Scanner;

public class CodeJam3 {

	public static void main(String[] args) {
		Scanner kb=new Scanner(System.in);
		int cases=kb.nextInt();
		for(int i=0;i<cases;i++)
		{
			long count=0;
			long value1=kb.nextInt();
			long value2=kb.nextInt();
			ArrayList<String> al=new ArrayList<String>();
			for(long k=value1;k<value2;k++)
			{
				String start=new Long(k).toString();
				long back=0;
				long next=0;
				for(int j=1;j<start.length();j++)
				{ 
					String temp=start.substring(j)+start.substring(0,j);
					long temp1=Long.parseLong(temp);
					next=temp1;
					if(value1<=k && k<temp1 && temp1<=value2)
					{
						/*al.add(temp);int m;
						for(m=0;m<al.size();m++)
						{
							if(temp1==Long.parseLong(al.get(m)))
							{
								
							}
						}
						if(m==al.size())
						{
							count++;
						}*/
						if(next!=back)
						{
							count++;
						}
						back=next;
						
						//System.out.println(k+"  "+temp1);
					}
				}					
			}
			System.out.println("Case #"+(i+1)+": "+count);
		}
		

	}

}
