
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}
import java.util.HashMap;
import java.util.Scanner;


public class Recycle {
    
    private static HashMap<Pair2, Boolean> mCache = new HashMap<Pair2, Boolean>();
    
    public static boolean isRecycle(int a, int b) {
        if (a >= b) return false;
        Pair2 p = new Pair2(a, b);
        Boolean cacheValue = mCache.get(p);
        if (cacheValue != null) return cacheValue;
        
        //System.out.println("isRecycle(" + a + ", " + b + ")");
        
        int len = (int)Math.floor(Math.log10(b));
        for (int i = 0; i < len; i++) {
            b = b / 10 + (b % 10) * pow10(len);
            //System.out.println(b);
            if (a == b) {
                mCache.put(p, true);
                return true;
            }
        }
        
        mCache.put(p, false);
        return false;
    }
    
    public static int pow10(int pow) {
        int ret = 1;
        for (int i = 0; i < pow; i++) {
            ret *= 10;
        }
        return ret;
    }
    
    public static int countRecycle(int start, int end) {
        int count = 0;
        for (int i = start; i <= end; i++) {
            for (int j = i; j <= end; j++) {
                if (isRecycle(i, j)) {
                    count++;
                }
            }
        }
        return count;
    }
    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int num = in.nextInt();
        
        for (int i = 0; i < num; i ++) {
            int a = in.nextInt();
            int b = in.nextInt();
            System.out.println("Case #" + (i + 1) + ": " + countRecycle(a, b));
        }
    }
}
