
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.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.util.Scanner;

class Solution {
    private final String FILE_IN = "C-small-attempt0.in";
    private final String FILE_OUT = "C-small-attempt0.out";
    
    private final Scanner mScanner;
    private final PrintWriter mOut;

    private final int[] shifts = new int[7];
    private int shiftsCount = 0;
    
    public Solution() throws FileNotFoundException {
        mScanner = new Scanner(new FileInputStream(FILE_IN));
        mOut = new PrintWriter(new FileOutputStream(FILE_OUT));
    }
    
    public void closeFiles() {
        mScanner.close();
        mOut.close();
    }
    
    private int digitsAmount(int number) {
        int r = 0;
        while (number > 0) {
            number /= 10;
            r++;
        }
        return r;
    }
    
    private static int shiftRight(int number, int d) {
        int last = number % 10;
        for (int i = 0; i < d - 1; i++) {
            last *= 10;
        }
        
        return number / 10 + last;
    }
    
    private boolean isShiftedAlready(int shifted) {
        for (int i = 0; i < shiftsCount; i++) {
            if (shifts[i] == shifted) {
                return true;
            }
        }
        return false;
    }
    
    private void solve(int caseId, int A, int B) {
        int r = 0;
        int d = digitsAmount(A);
        
        for (int i = A; i < B; i++) {
            int shifted = i;
            shiftsCount = 0;
            for (int k = 0; k < d - 1; k++) {
                shifted = shiftRight(shifted, d);
                if (i < shifted && shifted <= B && !isShiftedAlready(shifted)) {
                    r++;
                    shifts[shiftsCount] = shifted;
                    shiftsCount++;
                }
            }
        }
        mOut.println("Case #" + (caseId + 1) + ": " + r);
    }
    
    public Solution run() {
        int n = mScanner.nextInt();
        mScanner.nextLine();
        
        for (int i = 0; i < n; i++) {
            int A = mScanner.nextInt();
            int B = mScanner.nextInt();
            if (mScanner.hasNext()) {
                mScanner.nextLine();
            }
            
            solve(i, A, B);
        }
        return this;
    }
}

public class Main {
    public static void main(String[] args) throws FileNotFoundException {
        new Solution().run().closeFiles();
    }
}
