package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.util.LinkedList;
import java.util.HashMap;
import java.util.Scanner;

public class Recycled
{
	public static void main(String[] args) throws Exception
	{
        HashMap<Integer,LinkedList<String>> lol = new HashMap<Integer,LinkedList<String>>(); 
        
        for( int i = 1 ; i <= 2500; i++ )
        {
            LinkedList<String> ll = new LinkedList<String>();
            String _i = i + "";
            for( int k = 0 ; k < _i.length();k++)
            {
                String t = _i.substring( k , _i.length() ) + _i.substring( 0 , k );
                for( int j = 4 - t.length(); j >= 0; j-- )
                {
                    ll.add( t );
                    t = t + "0";
                }
            }
            
            lol.put( i , ll );
                
        }
    
		Scanner in = new Scanner( System.in );
		
		int size = in.nextInt();
        
		for( int pos = 1 ; pos <= size ;pos++ )
		{
			int A = in.nextInt();
			int B = in.nextInt();
			
			String _A = A + "";
			String _B = B + "";
			
            int count = 0;
            
			for( int i = A ; i < B ; i++ )
			{
				String a = i + "";
				if( a.length() != _A.length() ) continue;
				for( int j = i + 1; j <= B; j++ )
				{
					String b = j + "";
					if( b.length() != _B.length() ) continue;
                    
                    LinkedList<String> ll = lol.get( i );
                    if( ll.contains( b ) )
                    {
                        count++;
                    }	
				}
			}
			
			
			System.out.println("Case #" + pos + ": " + count);
		}
	}
}