
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;
	}
	

}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumber;

/**
 *
 * @author pos
 */
public class Numbers {

    int A;
    int B;
    int n;
    int m;
    int Result;

    public Numbers(int A, int B) {
        this.A = A;
        this.B = B;
        this.n = A;
        this.m = n + 1;
    }
    
    String sn;
    String sm;
    int nLength;
    int mLength;
    int nIndex;
    int mIndex;

    private boolean isValid(int n, int m) {
        int[] numberN = new int[10];
        int[] numberM = new int[10];

        sn = n + "";
        sm = m + "";
        nLength = sn.length();
        mLength = sm.length();

        for (int i = 0; i < nLength; i++) {
            nIndex = Integer.valueOf(sn.charAt(i)) - 48;
            numberN[nIndex]++;
            mIndex = Integer.valueOf(sm.charAt(i)) - 48;
            numberM[mIndex]++;
        }
        for (int i = 0; i < 10; i++) {
            if (numberN[i] != numberM[i]) {
                return false;
            }
        }
        //System.out.println(A + "<=" + n + "<" + m + "<=" + B);
        return true;
    }

    public void Calculate() {
        int n, m;
        for (int i = this.A; i < this.B; i++) {
            for (int j = i+1; j <= this.B; j++) {
                n = i;
                m = j;
                if (isValid(n, m))
                    isRecycled(n, m);
            }
        }
    }
    
    private boolean isRecycled(int n, int m){
        String sn=n+"";
        nLength=sn.length();
        for(int i=1;i<nLength;i++){
            if (Integer.valueOf(sn.substring(i)+sn.substring(0, i))==m){
                Result++;
                return true;
            }
        }
        return false;
    }
}
