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);
		}
	}
}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumbers;

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 *
 * @author topik
 */
public class RecycledNumbers
{

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args)
    {
        final Scanner scanner = new Scanner(System.in);
        final int testCases = scanner.nextInt();
        for( int tc=1; tc <= testCases; tc++ )
        {
            final int a = scanner.nextInt();
            final int b = scanner.nextInt();
            int total = 0;
            
            for( int n = a > 10 ? a : 10; n < b; n++ )
            {
                final Set<Integer> seen = new HashSet<Integer>();
                final String nStr = Integer.toString(n);
                final int nStrLen = nStr.length();
                for( int replace = 1; replace < nStrLen; replace++ )
                {
                    final String mStr = nStr.substring(nStrLen - replace) + nStr.substring(0, nStrLen - replace);
                    final int m = Integer.parseInt(mStr);
                    if( m <= b && m > n && ! seen.contains(m) )
                    {
                        seen.add(m);
                        total++;
                    }
                }
            }
            
            System.out.println("Case #" + tc + ": " + total);
        }
    }
}
