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;

class Recycle{
    static Scanner sc = new Scanner(System.in);
    static long[] pow={1,10,100,1000,10000,100000,1000000,10000000};
    public static void solve()
    {
	long A =sc.nextInt();
	long B =sc.nextInt();
	long sum=0;
	long j;
	String si,sj,sk;
	int tj,k;
	Boolean t2,t=false;
	int d,z='0';
	for(long i=A;i<=B;i++)
	    {if(i>9){
		    // t=(i%10==0);
		
	     	    // j=(i/10)+(i%10)*pow[(int)Math.round(Math.floor(Math.log(i)/Math.log(10)))];
		    si=""+i;
		    // tj=(int)(j%10);
		    // d=z+tj;
		    sj=si;
		    sk="";
		    sk=sk+sj.charAt(sj.length()-1);
		    for(k=1;k<sj.length();k++)
			sk=sk+sj.charAt(k-1);
		    // t2=t;
		    j=Integer.parseInt(sk);
		    
	     	    //System.out.println(i+" "+j);
		    while(!sk.equals(si))
			{
			    if(j>i && j<=B && j>=A && sk.charAt(0)!=0 && si.charAt(0)!=0)
				sum++;
			    sj=sk;
			    sk="";
			    sk=sk+sj.charAt(sj.length()-1);
			    for(k=1;k<sj.length();k++)
				sk=sk+sj.charAt(k-1);
			    j=Integer.parseInt(sk);
			    //System.out.println(i+" "+si+" "+j+" "+sk);
			    // if(!t2)
			    // 	j=(j/10)+(j%10)*pow[(int)Math.round(Math.floor(Math.log(j)/Math.log(10)))];	
			    // else
			    // 	j=(j/10)+(j%10)*pow[1+(int)Math.round(Math.floor(Math.log(j)/Math.log(10)))];
			    // t2=t;
			}
	     	}

	    }
	
	System.out.println(sum);
    }

    public static void main(String[] args)
    {
	int n=sc.nextInt();
	sc.nextLine();

	for(int i=0;i<n;i++)
	    {
		System.out.print("Case #"+(i+1)+": ");
		solve();
	    }
    }
    
}